Integer Programming and Combinatorial Optimization

16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings

  • Michel Goemans
  • José Correa
Conference proceedings IPCO 2013

DOI: 10.1007/978-3-642-36694-9

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

Table of contents (33 papers)

  1. Front Matter
  2. On the Structure of Reduced Kernel Lattice Bases
    Karen Aardal, Frederik von Heymann
    Pages 1-12
  3. All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns
    Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz et al.
    Pages 13-24
  4. Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path
    Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
    Pages 25-36
  5. Intersection Cuts for Mixed Integer Conic Quadratic Sets
    Kent Andersen, Anders Nedergaard Jensen
    Pages 37-48
  6. Content Placement via the Exponential Potential Function Method
    David Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K. K. Ramakrishnan
    Pages 49-61
  7. Blocking Optimal Arborescences
    Attila Bernáth, Gyula Pap
    Pages 74-85
  8. Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
    Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer
    Pages 86-97
  9. A Complexity and Approximability Study of the Bilevel Knapsack Problem
    Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger
    Pages 98-109
  10. Matroid and Knapsack Center Problems
    Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang
    Pages 110-122
  11. Cut-Generating Functions
    Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick
    Pages 123-132
  12. Reverse Chvátal-Gomory Rank
    Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe
    Pages 133-144
  13. On Some Generalizations of the Split Closure
    Sanjeeb Dash, Oktay Günlük, Diego Alejandro Morán Ramirez
    Pages 145-156
  14. Packing Interdiction and Partial Covering Problems
    Michael Dinitz, Anupam Gupta
    Pages 157-168
  15. An Improved Integrality Gap for Asymmetric TSP Paths
    Zachary Friggstad, Anupam Gupta, Mohit Singh
    Pages 181-192
  16. A Stochastic Probing Problem with Applications
    Anupam Gupta, Viswanath Nagarajan
    Pages 205-216
  17. Thrifty Algorithms for Multistage Robust Optimization
    Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani
    Pages 217-228

About these proceedings

Introduction

This book constitutes the proceedings of the 16th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2013, held in Valparaíso, Chile, in March 2013. The 33 full papers presented were carefully reviewed and selected from 98 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. 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

co-graphic matroids knapsack problem multistage robust optimization quadratic programming scheduling

Editors and affiliations

  • Michel Goemans
    • 1
  • José Correa
    • 2
  1. 1.Massachusetts Institute of TechnologyCambridgeUSA
  2. 2.Universidad de ChileSantiagoChile

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-36693-2
  • Online ISBN 978-3-642-36694-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349