Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2022

Integer Programming and Combinatorial Optimization

23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings

Editors:

  1. Karen Aardal

    1. Delft University of Technology, Delft, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Laura Sanità

    1. Eindhoven University of Technology, Eindhoven, The Netherlands

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

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

Conference proceedings info: IPCO 2022.

Sections

Buy it now

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

  2. Total Dual Dyadicness and Dyadic Generating Sets

    • Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
    Pages 1-14

  3. Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing

    • Markus Ahrens, Dorothee Henke, Stefan Rabenstein, Jens Vygen
    Pages 15-28

  4. On the Maximal Number of Columns of a \(\varDelta \)-modular Matrix

    • Gennadiy Averkov, Matthias Schymura
    Pages 29-42

  5. The Simultaneous Semi-random Model for TSP

    • Eric Balkanski, Yuri Faenza, Mathieu Kubik
    Pages 43-56

  6. A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem

    • Étienne Bamas, Marina Drygala, Ola Svensson
    Pages 57-69

  7. Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition

    • Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai
    Pages 70-83

  8. Improving the Cook et al. Proximity Bound Given Integral Valued Constraints

    • Marcel Celaya, Stefan Kuhlmann, Joseph Paat, Robert Weismantel
    Pages 84-97

  10. A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in \(\mathsf {FPT}\) Time

    • Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo
    Pages 112-125

  11. Optimal Item Pricing in Online Combinatorial Auctions

    • José Correa, Andrés Cristi, Andrés Fielbaum, Tristan Pollner, S. Matthew Weinberg
    Pages 126-139

  12. On Circuit Diameter Bounds via Circuit Imbalances

    • Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh
    Pages 140-153

  13. A Simple Method for Convex Optimization in the Oracle Model

    • Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
    Pages 154-167

  14. On the Complexity of Separation from the Knapsack Polytope

    • Alberto Del Pia, Jeff Linderoth, Haoran Zhu
    Pages 168-180

  20. Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands

    • Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour
    Pages 251-261
Back to top

Other Volumes

  1. Integer Programming and Combinatorial Optimization

Back to top

About this book

This book constitutes the refereed proceedings of the 23rd International Conference on Integer Programming and Combinatorial Optimization, IPCO 2022, held in Eindhoven, The Netherlands, in June 2022. The 33 full papers presented were carefully reviewed and selected from 93 submissions addressing key techniques of document analysis. 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.
Back to top

Keywords

  • adaptive algorithms
  • approximation algorithms
  • approximation ratios
  • approximation scheme
  • approximation theory
  • artificial intelligence
  • combinatorial mathematics
  • combinatorial optimization
  • combinatorial problems
  • computer science
  • computer systems
  • correlation analysis
  • engineering
  • graph theory
  • internet
  • mathematics
  • optimization
  • polynomial approximation
  • signal processing
  • theoretical computer science
Back to top

Editors and Affiliations

  • Delft University of Technology, Delft, The Netherlands

    Karen Aardal

  • Eindhoven University of Technology, Eindhoven, The Netherlands

    Laura Sanità

Back to top

Bibliographic Information

Back to top
Access via your institution

Buy it now

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

search

Navigation