Skip to main content
SpringerLink
Log in

Integer Programming and Combinatorial Optimization

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

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Oktay Günlük

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gerhard J. Woeginger

    1. Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • 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)

Included in the following conference series:

Conference proceedings info: IPCO 2011.

This is a preview of subscription content, log in via an institution to check access.

Access this book

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

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (33 papers)

  1. Front Matter

    Download chapter PDF

  2. An Excluded Minor Characterization of Seymour Graphs

    • Alexander Ageev, Yohann Benchetrit, András Sebő, Zoltán Szigeti
    Pages 1-13

  3. Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes

    • Yu Hin Au, Levent Tunçel
    Pages 14-26

  4. A Probabilistic Analysis of the Strength of the Split and Triangle Closures

    • Amitabh Basu, Gérard Cornuéjols, Marco Molinaro
    Pages 27-38

  5. 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

  6. Lift-and-Project Cuts for Mixed Integer Convex Programs

    • Pierre Bonami
    Pages 52-64

  7. TSP on Cubic and Subcubic Graphs

    • Sylvia Boyd, René Sitters, Suzanne van der Ster, Leen Stougie
    Pages 65-77

  8. Approximability of Capacitated Network Design

    • Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula
    Pages 78-91

  9. Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems

    • Deeparnab Chakrabarty, Chaitanya Swamy
    Pages 92-103

  10. An Exact Rational Mixed-Integer Programming Solver

    • William Cook, Thorsten Koch, Daniel E. Steffy, Kati Wolter
    Pages 104-116

  11. Valid Inequalities for the Pooling Problem with Binary Variables

    • Claudia D’Ambrosio, Jeff Linderoth, James Luedtke
    Pages 117-129

  12. On the Chvátal-Gomory Closure of a Compact Convex Set

    • Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma
    Pages 130-142

  13. Design and Verify: A New Scheme for Generating Cutting-Planes

    • Santanu S. Dey, Sebastian Pokutta
    Pages 143-155

  14. Contact Center Scheduling with Strict Resource Requirements

    • Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy
    Pages 156-169

  15. Set Covering with Ordered Replacement: Additive and Multiplicative Gaps

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

  16. Backdoor Branching

    • Matteo Fischetti, Michele Monaci
    Pages 183-191

  17. A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games

    • Oliver Friedmann
    Pages 192-206

  18. An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming

    • Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos
    Pages 207-222

  19. A New Approach to the Stable Set Problem Based on Ellipsoids

    • Monia Giandomenico, Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio
    Pages 223-234

  20. Capacitated Vehicle Routing with Non-uniform Speeds

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

Other volumes

  1. Integer Programming and Combinatoral Optimization

Keywords

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.

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

Publish with us

Policies and ethics

Back to top

Search

Navigation