Integer Programming and Combinatorial Optimization

by Lodi, Andrea; Panconesi, Alessandro; Rinaldi, Giovanni

• ISBN13: 9783540688860
• ISBN10: 3540688862
• Format: Paperback
• Copyright: 2008-06-30
• Publisher: Springer-Verlag New York Inc

Summary

This book constitutes the refereed proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2008, held in Bertinoro, Italy, in May 2008. The 32 revised full papers presented were carefully reviewed and selected from 95 submissions. The papers cover various aspects of integer programming and combinatorial optimization and present recent developments in theory, computation, and applications in that area. Topics included are such as approximation algorithms, branch and bound algorithms, branch and cut algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms and competitive analysis, polyhedral combinatorics, randomized algorithms, random graphs, scheduling theory and scheduling algorithms, and semidefinite programs.

Table of Contents

Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables	p. 1
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs	p. 17
The Air Traffic Flow Management Problem: An Integer Optimization Approach	p. 34
The Induced Disjoint Paths Problem	p. 47
A Weighted K[subscript t,t]-Free t-Factor Algorithm for Bipartite Graphs	p. 62
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs	p. 77
A Polynomial Algorithm for Weighted Abstract Flow	p. 97
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem	p. 112
Binary Positive Semidefinite Matrices and Associated Integer Polytopes	p. 125
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities	p. 140
Tight Bounds for Permutation Flow Shop Scheduling	p. 154
The Stochastic Machine Replenishment Problem	p. 169
A Polynomial Time Approximation Scheme for the Square Packing Problem	p. 184
Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints	p. 199
Computing with Multi-row Gomory Cuts	p. 214
Constraint Orbital Branching	p. 225
A Fast, Simpler Algorithm for the Matroid Parity Problem	p. 240
Degree Bounded Matroids and Submodular Flows	p. 259
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle	p. 273
Primal-Dual Schema for Capacitated Covering Problems	p. 288
Offline and Online Facility Leasing	p. 303
Importance Sampling via Load-Balanced Facility Location	p. 316
A Constant Approximation Algorithm for the a priori Traveling Salesman Problem	p. 331
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem	p. 344
Min Sum Edge Coloring in Multigraphs Via Configuration LP	p. 359
An Improved Algorithm for Finding Cycles Through Elements	p. 374
The Stable Roommates Problem with Choice Functions	p. 385
A New Approach to Splitting-Off	p. 401
Can Pure Cutting Plane Algorithms Work?	p. 416
The Mixing Set with Divisible Capacities	p. 435
A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging	p. 450
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles	p. 463
Author Index	p. 477
Table of Contents provided by Blackwell. All Rights Reserved.