Skip to main content
  • Conference proceedings
  • © 2017

Integer Programming and Combinatorial Optimization

19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings

Editors:

(view affiliations)

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

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

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

Conference proceedings info: IPCO 2017.

Buying options

eBook
USD 64.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-59250-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD 84.99
Price excludes VAT (USA)

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

Table of contents (36 papers)

  1. Front Matter

    Pages I-XI
  2. The Two-Point Fano and Ideal Binary Clutters

    • Ahmad Abdi, Bertrand Guenin
    Pages 1-12
  3. On Scheduling Coflows

    • Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang
    Pages 13-24
  4. Integrality Gaps of Integer Knapsack Problems

    • Iskander Aliev, Martin Henk, Timm Oertel
    Pages 25-38
  5. An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut

    • Haris Angelidakis, Yury Makarychev, Pasin Manurangsi
    Pages 39-50
  6. Approximation of Corner Polyhedra with Families of Intersection Cuts

    • Gennadiy Averkov, Amitabh Basu, Joseph Paat
    Pages 51-62
  7. The Structure of the Infinite Models in Integer Programming

    • Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat
    Pages 63-74
  8. Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination

    • Amitabh Basu, Kipp Martin, Christopher Thomas Ryan, Guanyi Wang
    Pages 75-85
  9. Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time

    • Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger
    Pages 86-98
  10. Cutting Planes from Wide Split Disjunctions

    • Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese
    Pages 99-110
  11. The Saleman’s Improved Tours for Fundamental Classes

    • Sylvia Boyd, András Sebő
    Pages 111-122
  12. The Heterogeneous Capacitated k-Center Problem

    • Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar
    Pages 123-135
  13. Local Guarantees in Graph Cuts and Clustering

    • Moses Charikar, Neha Gupta, Roy Schwartz
    Pages 136-147
  14. Verifying Integer Programming Results

    • Kevin K. H. Cheung, Ambros Gleixner, Daniel E. Steffy
    Pages 148-160
  15. Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks

    • Roberto Cominetti, José Correa, Neil Olver
    Pages 161-172
  16. A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem

    • Szymon Dudycz, Jan Marcinkowski, Katarzyna Paluch, Bartosz Rybicki
    Pages 173-185
  17. Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems

    • Daniel Freund, Shane G. Henderson, David B. Shmoys
    Pages 186-198
  18. Discrete Newton’s Algorithm for Parametric Submodular Function Minimization

    • Michel X. Goemans, Swati Gupta, Patrick Jaillet
    Pages 212-227
  19. Stochastic Online Scheduling on Unrelated Machines

    • Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie
    Pages 228-240

Other Volumes

  1. Integer Programming and Combinatorial Optimization

    19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings

About this book

This book constitutes the refereed proceedings of the 19th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2017, held in Waterloo, IN, Canada, in June 2017.

The 36 full papers presented were carefully reviewed and selected from 125 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. 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

  • Approximation theory
  • Combinatorial optimization
  • Computational results
  • Integer programming
  • Linear programming
  • Game theory
  • Graph theory
  • Heuristic methods
  • Problem solving
  • Scheduling algorithms
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Ecole Polytechnique Federale de Lausanne - EPFL, Lausanne, Switzerland

    Friedrich Eisenbrand

  • University of Waterloo, Waterloo, Canada

    Jochen Koenemann

Bibliographic Information

Buying options

eBook
USD 64.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-59250-3
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD 84.99
Price excludes VAT (USA)