# Integer programming and combinatorial optimization : 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004 : proceedings / Daniel Bienstock, George Nemhauser (eds.).

##### By: (10th : Conference on Integer Programming and Combinatorial Optimization (10th : 2004 : New York, N.Y.)

##### Contributor(s): Bienstock, Daniel | Nemhauser, George L

Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 3064.Publisher: Berlin ; New York : Springer, ©2004Description: 1 online resource (xi, 443 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 3540259600; 9783540259602Subject(s): Integer programming -- Congresses | Combinatorial optimization -- Congresses | MATHEMATICS -- Linear & Nonlinear Programming | Combinatorial optimization | Integer programmingGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Integer programming and combinatorial optimization.DDC classification: 519.7/7 LOC classification: T57.74 | .C625 2004ebOther classification: 54.51 | 58.17 | MAT 913f | SD 2004 | SS 4800 Online resources: Click here to access onlineItem type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|

eBook |
e-Library
Electronic Book@IST |
EBook | Available |

"Tenth International Conference on Integer Programming and Combinatorial Optimization"--Preface.

Includes bibliographical references and index.

Print version record.

This book constitutes the refereed proceedings of the 10th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2004, held in New York City, USA in June 2004. The 32 revised papers presented were carefully reviewed and selected from 109 submissions. Among the topics addressed are vehicle routing, network management, mixed-integer programming, computational complexity, game theory, supply chain management, stochastic optimization problems, production scheduling, graph computations, computational graph theory, separation algorithms, local search, linear optimization, integer programming, graph coloring, packing, combinatorial optimization, routing, flow algorithms, 0/1 polytopes, and polyhedra.

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.

There are no comments for this item.