Integer Programming and Combinatorial Optimization

1. Front Matter

   PDF

2. Solving LP Relaxations of Large-Scale Precedence Constrained Problems

   • Daniel Bienstock, Mark Zuckerberg

   Pages 1-14

3. Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings

   • Takuro Fukunaga

   Pages 15-28

4. Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems

   • Daniel Bienstock

   Pages 29-42

5. Restricted b-Matchings in Degree-Bounded Graphs

   • Kristóf Bérczi, László A. Végh

   Pages 43-56

6. Zero-Coefficient Cuts

   • Kent Andersen, Robert Weismantel

   Pages 57-70

7. Prize-Collecting Steiner Network Problems

   • MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov

   Pages 71-84

8. On Lifting Integer Variables in Minimal Inequalities

   • Amitabh Basu, Manoel Campelo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli

   Pages 85-95

9. Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities

   • Lap Chi Lau, Chun Kong Yung

   Pages 96-109

10. On Generalizations of Network Design Problems with Degree Bounds

    • Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis

    Pages 110-123

11. A Polyhedral Study of the Mixed Integer Cut

    • Steve Tyber, Ellis L. Johnson

    Pages 124-134

12. Symmetry Matters for the Sizes of Extended Formulations

    • Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis

    Pages 135-148

13. A 3-Approximation for Facility Location with Uniform Capacities

    • Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta et al.

    Pages 149-162

14. Secretary Problems via Linear Programming

    • Niv Buchbinder, Kamal Jain, Mohit Singh

    Pages 163-176

15. Branched Polyhedral Systems

    • Volker Kaibel, Andreas Loos

    Pages 177-190

16. Hitting Diamonds and Growing Cacti

    • Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli

    Pages 191-204

17. Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems

    • Andreas Bley, Jose Neto

    Pages 205-218

18. A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs

    • Raymond Hemmecke, Matthias Köppe, Robert Weismantel

    Pages 219-229

19. Universal Sequencing on a Single Machine

    • Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella et al.

    Pages 230-243

20. Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm

    • Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy

    Pages 244-257

Theidea ofa refereedconferencefor the mathematicalprogrammingcommunity was proposed by Ravi Kannan and William Pulleyblank to the Mathematical Programming Society (MPS) in the late 1980s. Thus IPCO was born, and MPS has sponsored the conference as one of its main events since IPCO I at the University of Waterloo in 1990. The conference has become the main forum for recent results in Integer Programming and Combinatorial Optimization in the non-Symposium years. This volume compiles the papers presented at IPCO XIV held June 9-11, 2010, at EPFL in Lausanne. The scope of papers considered for IPCO XIV is likely broader than at IPCO I. This is sometimes due to the wealth of new questions and directions brought from related areas. It can also be due to the successful application of “math programming” techniques to models not tra- tionally considered. In any case, the interest in IPCO is greater than ever and this is re?ected in both the number (135) and quality of the submissions. The ProgrammeCommittee with 13 memberswasalsoIPCO’slargest. We thankthe members of the committee, as well as their sub-reviewers, for their exceptional (and time-consuming) work and especially during the online committee meeting held over January. The process resulted in the selection of 34 excellent research papers which were presented in non-parallel sessions over three days in L- sanne. Unavoidably, this has meant that many excellent submissions were not able to be included.

• Matchings
• Scheduling
• algorithms
• branch algorithms
• combinatorial optimization
• computational graph theory
• graph algorithms
• hypertrees
• integer programming
• linear optimization
• optimization
• algorithm analysis and problem complexity
• data structures

• Institute of Mathematics, École Polytechnique Féderale de Lausanne, Lausanne, Switzerland

  Friedrich Eisenbrand

• McGill University, Montreal, Canada

  F. Bruce Shepherd

Policies and ethics