Integer Programming and Combinatoral Optimization

15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings

  • Oktay Günlük
  • Gerhard J. Woeginger

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

Table of contents

  1. Front Matter
  2. Alexander Ageev, Yohann Benchetrit, András Sebő, Zoltán Szigeti
    Pages 1-13
  3. Amitabh Basu, Gérard Cornuéjols, Marco Molinaro
    Pages 27-38
  4. Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi
    Pages 39-51
  5. Sylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
    Pages 65-77
  6. Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula
    Pages 78-91
  7. William Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter
    Pages 104-116
  8. Claudia D’Ambrosio, Jeff Linderoth, James Luedtke
    Pages 117-129
  9. Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
    Pages 130-142
  10. Santanu S. Dey, Sebastian Pokutta
    Pages 143-155
  11. Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy
    Pages 156-169
  12. Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità
    Pages 170-182
  13. Matteo Fischetti, Michele Monaci
    Pages 183-191
  14. Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
    Pages 223-234
  15. Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
    Pages 235-247

About these proceedings

Introduction

This book constitutes the proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2011, held in New York, USA in June 2011.
The 33 papers presented were carefully reviewed and selected from 110 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.

Keywords

cutting plans matroids nonlinear programming safe computations verification schemes

Editors and affiliations

  • Oktay Günlük
    • 1
  • Gerhard J. Woeginger
    • 2
  1. 1.Mathematical Sciences DepartmentIBM T. J. Watson Research CenterYorktown HeightsUSA
  2. 2.Department of Mathematics and Computer ScienceTU EindhovenEindhovenThe Netherlands

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-20807-2
  • Copyright Information Springer Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-20806-5
  • Online ISBN 978-3-642-20807-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book