Skip to main content
SpringerLink
Log in

Integer Programming and Combinatorial Optimization

22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021, Proceedings

  • Conference proceedings
  • © 2021

Overview

Editors:
  1. Mohit Singh

    1. Georgia Institute of Technology, Atlanta, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. David P. Williamson

    1. Cornell University, Ithaca, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: IPCO 2021.

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 EPUB and 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. Speed-Robust Scheduling

    • Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon
    Pages 283-296

  2. The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs

    • Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
    Pages 297-310

  3. Fast Quantum Subroutines for the Simplex Method

    • Giacomo Nannicini
    Pages 311-325

  4. Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators

    • Guyslain Naves, Bruce Shepherd, Henry Xia
    Pages 326-339

  5. A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem

    • Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh
    Pages 340-353

  6. Fixed Parameter Approximation Scheme for Min-Max k-Cut

    • Karthekeyan Chandrasekaran, Weihang Wang
    Pages 354-367

  7. Computational Aspects of Relaxation Complexity

    • Gennadiy Averkov, Christopher Hojny, Matthias Schymura
    Pages 368-382

  8. Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II

    • Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang
    Pages 383-398

  9. Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs

    • Matthias Walter
    Pages 399-412

  10. Proximity Bounds for Random Integer Programs

    • Marcel Celaya, Martin Henk
    Pages 413-426

  11. On the Integrality Gap of Binary Integer Programs with Gaussian Data

    • Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
    Pages 427-442

  12. Linear Regression with Mismatched Data: A Provably Optimal Local Search Algorithm

    • Rahul Mazumder, Haoyue Wang
    Pages 443-457

  13. A New Integer Programming Formulation of the Graphical Traveling Salesman Problem

    • Robert D. Carr, Neil Simonetti
    Pages 458-472

  14. Implications, Conflicts, and Reductions for Steiner Trees

    • Daniel Rehfeldt, Thorsten Koch
    Pages 473-487

  15. Back Matter

    Pages 489-490
    Download chapter PDF
Back to top

Other volumes

  1. Integer Programming and Combinatorial Optimization

Keywords

About this book

This book constitutes the proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization, IPCO 2021, which took place during May 19-21, 2021. The conference was organized by Georgia Institute of Technology and planned to take place it Atlanta, GA, USA, but changed to an online format due to the COVID-19 pandemic. 
The 33 papers included in this book were carefully reviewed and selected from 90 submissions. IPCO is under the auspices of the Mathematical
Optimization Society, and it is an important forum for presenting the latest results of theory and practice of the various aspects of discrete optimization.



Editors and Affiliations

  • Georgia Institute of Technology, Atlanta, USA

    Mohit Singh

  • Cornell University, Ithaca, USA

    David P. Williamson

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation