Skip to main content
SpringerLink
Log in
Book cover

Integer Programming and Combinatorial Optimization

20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. Andrea Lodi

    1. École Polytechnique de Montréal, Montreal, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Viswanath Nagarajan

    1. University of Michigan, Ann Arbor, 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 11480)

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

Included in the following conference series:

Conference proceedings info: IPCO 2019.

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

Licence this eBook for your library

Institutional subscriptions

Table of contents (33 papers)

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. Identically Self-blocking Clutters

    • Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee
    Pages 1-12

  3. Min-Max Correlation Clustering via MultiCut

    • Saba Ahmadi, Samir Khuller, Barna Saha
    Pages 13-26

  4. Strong Mixed-Integer Programming Formulations for Trained Neural Networks

    • Ross Anderson, Joey Huchette, Christian Tjandraatmadja, Juan Pablo Vielma
    Pages 27-42

  5. Extended Formulations from Communication Protocols in Output-Efficient Time

    • Manuel Aprile, Yuri Faenza
    Pages 43-56

  6. Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry

    • Pascale Bendotti, Pierre Fouilhoux, Cécile Rottner
    Pages 57-71

  7. Intersection Cuts for Polynomial Optimization

    • Daniel Bienstock, Chen Chen, Gonzalo Muñoz
    Pages 72-87

  8. Fixed-Order Scheduling on Parallel Machines

    • Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters, Leen Stougie
    Pages 88-100

  9. Online Submodular Maximization: Beating 1/2 Made Simple

    • Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg
    Pages 101-114

  10. Improving the Integrality Gap for Multiway Cut

    • Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
    Pages 115-127

  11. \(\ell _1\)-sparsity Approximation Bounds for Packing Integer Programs

    • Chandra Chekuri, Kent Quanrud, Manuel R. Torres
    Pages 128-140

  12. A General Framework for Handling Commitment in Online Throughput Maximization

    • Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein
    Pages 141-154

  13. Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints

    • Federico Della Croce, Rosario Scatamacchia
    Pages 155-167

  14. On Friedmann’s Subexponential Lower Bound for Zadeh’s Pivot Rule

    • Yann Disser, Alexander V. Hopp
    Pages 168-180

  15. Tight Approximation Ratio for Minimum Maximal Matching

    • Szymon Dudycz, Mateusz Lewandowski, Jan Marcinkowski
    Pages 181-193

  16. Integer Programming and Incidence Treedepth

    • Eduard Eiben, Robert Ganian, Dušan Knop, Sebastian Ordyniak, Michał Pilipczuk, Marcin Wrochna
    Pages 194-204

  17. A Bundle Approach for SDPs with Exact Subgraph Constraints

    • Elisabeth Gaar, Franz Rendl
    Pages 205-218

  18. Dynamic Flows with Adaptive Route Choice

    • Lukas Graf, Tobias Harks
    Pages 219-232

  19. The Markovian Price of Information

    • Anupam Gupta, Haotian Jiang, Ziv Scully, Sahil Singla
    Pages 233-246

  20. On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup Theory and Equivariant Decomposition Theorem

    • Robert Hildebrand, Matthias Köppe, Yuan Zhou
    Pages 247-260
Back to top

Other volumes

  1. Integer Programming and Combinatorial Optimization

Keywords

About this book

This book constitutes the refereed proceedings of the 20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019, held in Ann Arbor, MI, USA, in May 2019.

The 33 full versions of extended abstracts presented were carefully reviewed and selected from 114 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas.

Editors and Affiliations

  • École Polytechnique de Montréal, Montreal, Canada

    Andrea Lodi

  • University of Michigan, Ann Arbor, USA

    Viswanath Nagarajan

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation