Skip to main content
  • Conference proceedings
  • © 2023

Integer Programming and Combinatorial Optimization

24th International Conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023, Proceedings

Conference proceedings info: IPCO 2023.

Buy it now

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 79.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

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

Table of contents (33 papers)

  1. Front Matter

    Pages i-xiii
  2. Information Complexity of Mixed-Integer Convex Optimization

    • Amitabh Basu, Hongyi Jiang, Phillip Kerger, Marco Molinaro
    Pages 1-13
  3. Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products

    • Ksenia Bestuzheva, Ambros Gleixner, Tobias Achterberg
    Pages 14-28
  4. A Nearly Optimal Randomized Algorithm for Explorable Heap Selection

    • Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
    Pages 29-43
  5. Sparse Approximation over the Cube

    • Sabrina Bruckmeier, Christoph Hunkenschröder, Robert Weismantel
    Pages 44-57
  6. Recycling Inequalities for Robust Combinatorial Optimization with Budget Uncertainty

    • Christina Büsing, Timo Gersing, Arie M. C. A. Koster
    Pages 58-71
  7. Inapproximability of Shortest Paths on Perfect Matching Polytopes

    • Jean Cardinal, Raphael Steiner
    Pages 72-86
  8. Monoidal Strengthening and Unique Lifting in MIQCPs

    • Antonia Chmiela, Gonzalo Muñoz, Felipe Serrano
    Pages 87-99
  9. From Approximate to Exact Integer Programming

    • Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
    Pages 100-114
  10. Optimizing Low Dimensional Functions over the Integers

    • Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae
    Pages 115-126
  11. Configuration Balancing for Stochastic Requests

    • Franziska Eberle, Anupam Gupta, Nicole Megow, Benjamin Moseley, Rudy Zhou
    Pages 127-141
  12. An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem

    • Satoru Fujishige, Tomonari Kitahara, László A. Végh
    Pages 142-156
  13. Stabilization of Capacitated Matching Games

    • Matthew Gerstbrein, Laura Sanità, Lucy Verberk
    Pages 157-171
  14. Designing Optimization Problems with Diverse Solutions

    • Oussama Hanguir, Will Ma, Christopher Thomas Ryan
    Pages 172-186
  15. On the Correlation Gap of Matroids

    • Edin Husić, Zhuan Khye Koh, Georg Loho, László A. Végh
    Pages 203-216
  16. A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP

    • Billy Jin, Nathan Klein, David P. Williamson
    Pages 217-230
  17. The Polyhedral Geometry of Truthful Auctions

    • Michael Joswig, Max Klimm, Sylvain Spitz
    Pages 231-245
  18. Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling

    • Sven Jäger, Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt, Philipp Warode
    Pages 246-260
  19. A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP

    • Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan
    Pages 261-274

Other Volumes

  1. Integer Programming and Combinatorial Optimization

About this book

This book constitutes the refereed proceedings of the 24th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2023, held in Madison, WI, USA, during June 21–23, 2023.

The 33 full papers presented were carefully reviewed and selected from 119 submissions. IPCO is under the auspices of the Mathematical Optimization Society, and it is an important forum for presenting 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

  • analysis of algorithms
  • approximation algorithms
  • combinatorial mathematics
  • combinatorial optimization
  • combinatorial problems
  • computer science
  • cutting planes
  • design of algorithms
  • discrete optimization
  • graph theory
  • integer programming
  • linear programming
  • mathematical optimization
  • mathematics
  • mixed integer programming
  • optimization problems
  • polynomial optimization
  • polynomial time algorithms
  • polynomial time complexity
  • theoretical computer science

Editors and Affiliations

  • University of Wisconsin-Madison, Madison, USA

    Alberto Del Pia

  • Otto-von-Guericke-Universität, Magdeburg, Germany

    Volker Kaibel

Bibliographic Information

Buy it now

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 79.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