Integer Programming and Combinatorial Optimization

1. Front Matter

   PDF

2. On the Structure of Reduced Kernel Lattice Bases

   • Karen Aardal, Frederik von Heymann

   Pages 1-12

3. All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns

   • Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz et al.

   Pages 13-24

4. Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path

   • Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese

   Pages 25-36

5. Intersection Cuts for Mixed Integer Conic Quadratic Sets

   • Kent Andersen, Anders Nedergaard Jensen

   Pages 37-48

6. Content Placement via the Exponential Potential Function Method

   • David Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K. K. Ramakrishnan

   Pages 49-61

7. Equivariant Perturbation in Gomory and Johnson’s Infinite Group Problem: II. The Unimodular Two-Dimensional Case

   • Amitabh Basu, Robert Hildebrand, Matthias Köppe

   Pages 62-73

8. Blocking Optimal Arborescences

   • Attila Bernáth, Gyula Pap

   Pages 74-85

9. Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property

   • Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer

   Pages 86-97

10. A Complexity and Approximability Study of the Bilevel Knapsack Problem

    • Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger

    Pages 98-109

11. Matroid and Knapsack Center Problems

    • Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang

    Pages 110-122

12. Cut-Generating Functions

    • Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick

    Pages 123-132

13. Reverse Chvátal-Gomory Rank

    • Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe

    Pages 133-144

14. On Some Generalizations of the Split Closure

    • Sanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramirez

    Pages 145-156

15. Packing Interdiction and Partial Covering Problems

    • Michael Dinitz, Anupam Gupta

    Pages 157-168

16. On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators

    • Hongbo Dong, Jeff Linderoth

    Pages 169-180

17. An Improved Integrality Gap for Asymmetric TSP Paths

    • Zachary Friggstad, Anupam Gupta, Mohit Singh

    Pages 181-192

18. Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids

    • Bertrand Guenin, Leanne Stuive

    Pages 193-204

19. A Stochastic Probing Problem with Applications

    • Anupam Gupta, Viswanath Nagarajan

    Pages 205-216

20. Thrifty Algorithms for Multistage Robust Optimization

    • Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani

    Pages 217-228

This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

• co-graphic matroids
• knapsack problem
• multistage robust optimization
• quadratic programming
• scheduling
• algorithm analysis and problem complexity

• Massachusetts Institute of Technology, Cambridge, USA

  Michel Goemans

• Universidad de Chile, Santiago, Chile

  José Correa

Policies and ethics