Integer programming and combinatorial optimization : 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004 : proceedings
Spremljeno u:
| Autor kompanije: | |
|---|---|
| Daljnji autori: | , |
| Format: | Livre numérique |
| Jezik: | Anglais |
| Izdano: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serija: | Lecture notes in computer science
3064 |
| Teme: | |
| Online pristup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Bilješka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Integer programming and combinatorial optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, proceedings, Daniel Bienstock, George Nemhauser (eds.), Berlin, Springer, 2004, 1 vol. (XI-443 p.), Lecture notes in computer science, 3-540-22113-1 • Integer Programming and Combinatorial Optimization, Texte imprimé, 9783662198117 |
Sadržaj:
- Session 1
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
- Metric Inequalities and the Network Loading Problem
- Valid Inequalities Based on Simple Mixed-Integer Sets
- Session 2
- The Price of Anarchy when Costs Are Non-separable and Asymmetric
- Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem
- Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games
- Session 3
- A Robust Optimization Approach to Supply Chain Management
- Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
- Scheduling an Industrial Production Facility
- Session 4
- Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs
- A TDI Description of Restricted 2-Matching Polytopes
- Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
- Session 5
- Semi-continuous Cuts for Mixed-Integer Programming
- Combinatorial Benders Cuts
- A Faster Exact Separation Algorithm for Blossom Inequalities
- Session 6
- LP-based Approximation Algorithms for Capacitated Facility Location
- A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem
- Separable Concave Optimization Approximately Equals Piecewise Linear Optimization
- Session 7
- Three Kinds of Integer Programming Algorithms Based on Barvinok s Rational Functions
- The Path-Packing Structure of Graphs
- More on a Binary-Encoded Coloring Formulation
- Session 8
- Single Machine Scheduling with Precedence Constraints
- The Constrained Minimum Weighted Sum of Job Completion Times Problem
- Session 9
- Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption
- A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts.-All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables
- Session 10
- A Capacity Scaling Algorithm for M-convex Submodular Flow
- Integer Concave Cocirculations and Honeycombs
- Minsquare Factors and Maxfix Covers of Graphs
- Session 11
- Low-Dimensional Faces of Random 0/1-Polytopes
- On Polyhedra Related to Even Factors
- Optimizing over Semimetric Polytopes.