Skip to main content
SpringerLink
Log in
Book cover

Integer Programming and Combinatorial Optimization

21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings

  • Conference proceedings
  • © 2020

Overview

Editors:
  1. Daniel Bienstock

    1. Department of IEOR, Columbia University, New York, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Giacomo Zambelli

    1. Department of Management, London School of Economics and Political Science, London, UK

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

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

Included in the following conference series:

Conference proceedings info: IPCO 2020.

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

  2. Idealness of k-wise Intersecting Families

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

  3. Flexible Graph Connectivity

    • David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler
    Pages 13-26

  4. Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts

    • Hassene Aissi, S. Thomas McCormick, Maurice Queyranne
    Pages 27-39

  5. Optimizing Sparsity over Lattices and Semigroups

    • Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel
    Pages 40-51

  6. A Technique for Obtaining True Approximations for k-Center with Covering Constraints

    • Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
    Pages 52-65

  7. Tight Approximation Bounds for Maximum Multi-coverage

    • Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpınar
    Pages 66-77

  8. Implementing Automatic Benders Decomposition in a Modern MIP Solver

    • Pierre Bonami, Domenico Salvagnin, Andrea Tramontani
    Pages 78-90

  9. Improved Approximation Algorithms for Inventory Problems

    • Thomas Bosman, Neil Olver
    Pages 91-103

  10. Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles

    • Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge
    Pages 104-116

  11. On a Generalization of the Chvátal-Gomory Closure

    • Sanjeeb Dash, Oktay Günlük, Dabeen Lee
    Pages 117-129

  12. Algorithms for Flows over Time with Scheduling Costs

    • Dario Frascaria, Neil Olver
    Pages 130-143

  13. Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation

    • Naveen Garg, Nikhil Kumar, András Sebő
    Pages 144-157

  14. Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract)

    • Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
    Pages 158-170

  15. Continuous Facility Location on Graphs

    • Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
    Pages 171-181

  16. Recognizing Even-Cycle and Even-Cut Matroids

    • Cheolwon Heo, Bertrand Guenin
    Pages 182-195

  17. A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 \(\times \) 2 Submatrices

    • Hiroshi Hirai, Yuni Iwamasa
    Pages 196-208

  18. Fair Colorful k-Center Clustering

    • Xinrui Jia, Kshiteej Sheth, Ola Svensson
    Pages 209-222

  19. Popular Branchings and Their Dual Certificates

    • Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
    Pages 223-237

  20. Sparse Graphs and an Augmentation Problem

    • Csaba Király, András Mihálykó
    Pages 238-251
Back to top

Other volumes

  1. Integer Programming and Combinatorial Optimization

Keywords

About this book

This book constitutes the refereed proceedings of the 21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, held in London, UK, in June 2020. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 126 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

  • Department of IEOR, Columbia University, New York, USA

    Daniel Bienstock

  • Department of Management, London School of Economics and Political Science, London, UK

    Giacomo Zambelli

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation