Integer Programming and Combinatorial Optimization: 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings

Oktay Günlük, Jeff Linderoth (auth.), Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi (eds.)3540688862, 9783540688860

The volume contains the papers selected for presentation at IPCO 2008, the 13th International Conference on Integer Programming and Combinatorial – timization that was held in Bertinoro (Italy), May 26–28, 2008. The IPCO series of conferences, sponsored by the Mathematical Progr- ming Society, highlights recent developments in theory, computation, and app- cation of integer programming and combinatorial optimization. The ?rst conf- ence took place in 1990; starting from IPCO 1995, the proceedings are published in the Lecture Notes in Computer Science series. The 12 previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995 [LNCS 920], Vancouver (Canada) 1996 [LNCS 1084], Houston (USA) 1998 [LNCS 1412], Graz (Austria) 1999 [LNCS 1610], Utrecht (The Netherlands) 2001 [LNCS 2081], Boston (USA) 2002 [LNCS 2337], New York (USA) 2004 [LNCS 2986], Berlin (Germany) 2005 [LNCS 3509], and Ithaca (USA) 2007 [LNCS 4168]. The c- ference is not held in the years when the International Symposium of the Ma- ematical Programming Society takes place.

---

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