© 2016

Integer Programming and Combinatorial Optimization

18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings

  • Quentin Louveaux
  • Martin Skutella
Conference proceedings IPCO 2016

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9682)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9682)

Table of contents

  1. Front Matter
    Pages I-XIII
  2. Daniel Dadush, László A. Végh, Giacomo Zambelli
    Pages 26-37
  3. Jon Lee, Viswanath Nagarajan, Xiangkun Shen
    Pages 50-62
  4. Matteo Fischetti, Ivana Ljubić, Michele Monaci, Markus Sinnl
    Pages 77-88
  5. Thai Dinh, Ricardo Fukasawa, James Luedtke
    Pages 89-101
  6. Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma
    Pages 102-113
  7. Mohit Singh, Rico Zenklusen
    Pages 114-125
  8. Corinna Gottschalk, Jens Vygen
    Pages 126-137
  9. Ágnes Cseh, Telikepalli Kavitha
    Pages 138-151
  10. Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
    Pages 152-163
  11. Sara Ahmadian, Hamideh Hosseinzadeh, Laura Sanità
    Pages 164-177
  12. Erik Lambrechts, Annette M. C. Ficker, Dries R. Goossens, Frits C. R. Spieksma
    Pages 178-189
  13. Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
    Pages 190-201
  14. Amitabh Basu, Robert Hildebrand, Marco Molinaro
    Pages 202-213
  15. Alberto Del Pia, Jeffrey Poskin
    Pages 214-225
  16. Ola Svensson, Jakub Tarnawski, László A. Végh
    Pages 226-237

About these proceedings


This book constitutes the refereed proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, held in Liège, Belgium, in June 2016. The 33 full papers presented were carefully reviewed and selected from 125 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. 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.


Approximation algorithms Combinatorial optimization Computational complexity Integer programming Linear programming Computational geometry Cutting planes Diophantine equations Geometry of numbers Graphs and networks Knapsack problem Matroids NP-completeness Online algorithms Polyhedral combinatorics Polynomial algorithm Randomized algorithms Scheduling Semidefinite programs Submodular functions

Editors and affiliations

  • Quentin Louveaux
    • 1
  • Martin Skutella
    • 2
  1. 1.Université de LiègeLiègeBelgium
  2. 2.Technische Universität BerlinBerlinGermany

Bibliographic information

Industry Sectors
IT & Software