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

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.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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, log in via an institution to check for access.

Table of contents (36 papers)

  1. Online Matroid Intersection: Beating Half for Random Arrival

    • Guru Prashanth Guruganesh, Sahil Singla
    Pages 241-253
  2. Number Balancing is as Hard as Minkowski’s Theorem and Shortest Vector

    • Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss, Xin Yang
    Pages 254-266
  3. An Improved Deterministic Rescaling for Linear Programming Algorithms

    • Rebecca Hoberg, Thomas Rothvoss
    Pages 267-278
  4. Min-Max Theorems for Packing and Covering Odd (u, v)-trails

    • Sharat Ibrahimpur, Chaitanya Swamy
    Pages 279-291
  5. Breaking \(1 - 1/e\) Barrier for Non-preemptive Throughput Maximization

    • Sungjin Im, Shi Li, Benjamin Moseley
    Pages 292-304
  6. Adaptive Submodular Ranking

    • Prabhanjan Kambadur, Viswanath Nagarajan, Fatemeh Navidi
    Pages 317-329
  7. Minimum Birkhoff-von Neumann Decomposition

    • Janardhan Kulkarni, Euiwoong Lee, Mohit Singh
    Pages 343-354
  8. Maximum Matching in the Online Batch-Arrival Model

    • Euiwoong Lee, Sahil Singla
    Pages 355-367
  9. Budget Feasible Mechanisms on Matroids

    • Stefano Leonardi, Gianpiero Monaco, Piotr Sankowski, Qiang Zhang
    Pages 368-379
  10. Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method

    • Avi Levy, Harishchandra Ramadas, Thomas Rothvoss
    Pages 380-391
  11. Mixed-Integer Convex Representability

    • Miles Lubin, Ilias Zadik, Juan Pablo Vielma
    Pages 392-404
  12. Equilibrium Computation in Atomic Splittable Singleton Congestion Games

    • Tobias Harks, Veerle Timmermans
    Pages 442-454
  13. Back Matter

    Pages 455-456

Other Volumes

  1. Integer Programming and Combinatorial Optimization

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.

Editors and Affiliations

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

    Friedrich Eisenbrand

  • University of Waterloo, Waterloo, Canada

    Jochen Koenemann

Bibliographic Information

Buy it now

Buying options

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