Integer Programming and Combinatorial Optimization

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 2628, 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.

Inhalt
Session 1.- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables.- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs.- The Air Traffic Flow Management Problem: An Integer Optimization Approach.- Session 2.- The Induced Disjoint Paths Problem.- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs.- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs.- A Polynomial Algorithm for Weighted Abstract Flow.- Session 3.- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem.- Binary Positive Semidefinite Matrices and Associated Integer Polytopes.- Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities.- Session 4.- Tight Bounds for Permutation Flow Shop Scheduling.- The Stochastic Machine Replenishment Problem.- A Polynomial Time Approximation Scheme for the Square Packing Problem.- Session 5.- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints.- Computing with Multi-row Gomory Cuts.- Constraint Orbital Branching.- Session 6.- A Fast, Simpler Algorithm for the Matroid Parity Problem.- Degree Bounded Matroids and Submodular Flows.- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle.- Session 7.- Primal-Dual Schema for Capacitated Covering Problems.- Offline and Online Facility Leasing.- Importance Sampling via Load-Balanced Facility Location.- Session 8.- A Constant Approximation Algorithm for the a priori Traveling Salesman Problem.- New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem.- Min Sum Edge Coloring in Multigraphs Via Configuration LP.- Session 9.- An Improved Algorithm for Finding Cycles Through Elements.- The Stable Roommates Problem with Choice Functions.- A New Approach to Splitting-Off.- Session 10.- Can Pure Cutting Plane Algorithms Work?.- The Mixing Set with Divisible Capacities.- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging.- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles.