Skip to main content
  • Conference proceedings
  • © 2011

Integer Programming and Combinatorial Optimization

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

  • Unique visibility

  • Fast-track conference proceedings

  • State-of-the-art research

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): IPCO: International Conference on Integer Programming and Combinatorial Optimization

Conference proceedings info: IPCO 2011.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (33 papers)

  1. Front Matter

  2. An Excluded Minor Characterization of Seymour Graphs

    • Alexander Ageev, Yohann Benchetrit, András Sebő, Zoltán Szigeti
    Pages 1-13
  3. A Probabilistic Analysis of the Strength of the Split and Triangle Closures

    • Amitabh Basu, Gérard Cornuéjols, Marco Molinaro
    Pages 27-38
  4. Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation

    • Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi
    Pages 39-51
  5. TSP on Cubic and Subcubic Graphs

    • Sylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
    Pages 65-77
  6. Approximability of Capacitated Network Design

    • Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula
    Pages 78-91
  7. An Exact Rational Mixed-Integer Programming Solver

    • William Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter
    Pages 104-116
  8. Valid Inequalities for the Pooling Problem with Binary Variables

    • Claudia D’Ambrosio, Jeff Linderoth, James Luedtke
    Pages 117-129
  9. On the Chvátal-Gomory Closure of a Compact Convex Set

    • Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
    Pages 130-142
  10. Design and Verify: A New Scheme for Generating Cutting-Planes

    • Santanu S. Dey, Sebastian Pokutta
    Pages 143-155
  11. Contact Center Scheduling with Strict Resource Requirements

    • Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy
    Pages 156-169
  12. Set Covering with Ordered Replacement: Additive and Multiplicative Gaps

    • Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità
    Pages 170-182
  13. Backdoor Branching

    • Matteo Fischetti, Michele Monaci
    Pages 183-191
  14. A New Approach to the Stable Set Problem Based on Ellipsoids

    • Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
    Pages 223-234
  15. Capacitated Vehicle Routing with Non-uniform Speeds

    • Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
    Pages 235-247

Other Volumes

  1. Integer Programming and Combinatoral Optimization

About this book

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
  • algorithm analysis and problem complexity
  • data structures

Editors and Affiliations

  • Mathematical Sciences Department, IBM T. J. Watson Research Center, Yorktown Heights, USA

    Oktay Günlük

  • Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands

    Gerhard J. Woeginger

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions