Handbook of Combinatorial Optimization
| Korporativní autor: | |
|---|---|
| Další autoři: | , , |
| Shrnutí: | XX, 4930 p. 100 illus., 50 illus. in color. text |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY :
Springer New York : Imprint: Springer,
2025.
|
| Témata: | |
| On-line přístup: | https://doi.org/10.1007/978-1-4614-6624-6 |
| Médium: | Elektronický zdroj Kniha |
Obsah:
- Introduction- Part 1. General Methodology
- Analysis of Greedy Approximations.-Guillotine Partition in Geometric Optimization.-Mixed-Integer Nonlinear Optimization in Process Synthesis.-Connection between Nonlinear Programming and Discrete Optimization.-Interior Point Methods for Combinatorial Optimization.-Fractional Combinatorial Optimization.-Reformulation-Linearization Techniques for Discrete Optimization Problems
- Grobner Bases in Integer Programming
- Dynamical System Approaches to Combinatorial Optimization. Semidefinite Relaxation, Multivariate Norma Distribution and Order Statistics
- Selected Algorithmic Techniques for Parallel Optimization
- Multispace Search for Combinatorial Optimization.-Randomized Parallel Algorithms for Combinatorial Optimization.-Tabu Search.-Neural Network Approach for Combinatorial Optimization.-Data Correcting Algorithms in Combinatorial Optimization.-Probabilistic Verification and Non-Approximability.-Part 2. Classic Problems.-The Steiner ratioof $L_p$-planes
- The Maximum Clique Problem.-The Generalized Assignment Problem and Extension.-Linear Assignment Problems and Extensions.-Bin Packing Approximation Algorithms: Combinatorial Analysis.-Feedback Set Problems.-The Equitable Coloring of Graphs.-Approximate Algorithms and Heuristics for MAX-SAT.-Knapsack Problems.-Steiner Minimum Trees in E^3.-The Graph Coloring Problem: A Bibliographic Survey.-Steiner Minimum Trees: An Introduction, Parallel Computation, and Future Work.-Resource Allocation Problems.-Efficient Algorithms for Geometric Shortest Path Query Problem.-On-line Dominating Set Problems for Graphs.-Minimum Weight Triangulation.-A review of Machine Scheduling: Complexity, Algorithms and Approximability.-Algorithmic Aspects of Domination in Graphs.-The Quadratic Assignment Problem.-A Cogitive Algorithm for solving the Equal Circles Packing Problem.-Optimal Rectangular Partition.-Weighted Dominating Set in Unit Disk Graphs.-Part 3. Applications
- Applications of SetCovering, Set Packing and Set Partitioning Models: A Survey.-Combinatorial Optimization in Clustering.-Combinatorial Optimization and Coalition Games.-Optimization Problems in Optical Networks.-Optimization Applications in the Airline Industry.-Routing and Topology Embedding in Lightwave Networks.-Steiner Tree in Industry.-Connected Dominating Sets in Sensor Networks.-Network-based Model and Algorithms in Data Mining and Knowledge Discovery.-Steiner Tree in VISL Designs.-Steiner Tree in Coal Mining Industry.-Coverage Problems in sensor Networks.-Packing, Dominating and Wireless Networking.-Group Testing in Molecular Biology
- Probabilistic set covering problems and applications
- Finite Gomory's group and its applications
- Branch and bound algorithms
- Hierarchies in clique problems
- Chapter title required
- Advances in Vehicle Routing Problems
- Cooperative networks
- Deep Learning for Influence Maximization
- Reinforcement Learning for Combinatorial Optimization
- Facility LocationGames
- Fair Allocation of Combinatorial Tasks
- Quantum computing for combinatorial optimization
- Graph-based diffusion solvers for combinatorial optimization
- Neural contextual bandits
- On k-Submodular Function Optimization
- Online Influence Maximization
- Facility location
- Popularity Prediction with Deep Learning
- The Metric Dimension of a Graph and its Variants
- Submodular and Nonsubmodular Optimization in Study of Social Networks
- Efficient Relaxation and Rounding Techniques for Submodular Optimization
- Monotone and Nonmonotone DR-submodular Maximization
- Index.