Integer Programming and Combinatorial Optimization: 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings

Front Matter....Pages -
On the Structure of Reduced Kernel Lattice Bases....Pages 1-12
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns....Pages 13-24
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path....Pages 25-36
Intersection Cuts for Mixed Integer Conic Quadratic Sets....Pages 37-48
Content Placement via the Exponential Potential Function Method....Pages 49-61
Equivariant Perturbation in Gomory and Johnson’s Infinite Group Problem: II. The Unimodular Two-Dimensional Case....Pages 62-73
Blocking Optimal Arborescences....Pages 74-85
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property....Pages 86-97
A Complexity and Approximability Study of the Bilevel Knapsack Problem....Pages 98-109
Matroid and Knapsack Center Problems....Pages 110-122
Cut-Generating Functions....Pages 123-132
Reverse Chvátal-Gomory Rank....Pages 133-144
On Some Generalizations of the Split Closure....Pages 145-156
Packing Interdiction and Partial Covering Problems....Pages 157-168
On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators....Pages 169-180
An Improved Integrality Gap for Asymmetric TSP Paths....Pages 181-192
Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids....Pages 193-204
A Stochastic Probing Problem with Applications....Pages 205-216
Thrifty Algorithms for Multistage Robust Optimization....Pages 217-228
Shallow-Light Steiner Arborescences with Vertex Delays....Pages 229-241
Two Dimensional Optimal Mechanism Design for a Sequencing Problem....Pages 242-253
Advances on Matroid Secretary Problems: Free Order Model and Laminar Case....Pages 254-265
A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets....Pages 266-277
The Complexity of Scheduling for p-Norms of Flow and Stretch....Pages 278-289
The Euclidean k -Supplier Problem....Pages 290-301
Facial Structure and Representation of Integer Hulls of Convex Sets....Pages 302-313
An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem....Pages 314-323
Chain-Constrained Spanning Trees....Pages 324-335
A Simpler Proof for $O(\textrm{Congestion} + \textrm{Dilation})$ Packet Routing....Pages 336-348
0/1 Polytopes with Quadratic Chvátal Rank....Pages 349-361
Eight-Fifth Approximation for the Path TSP....Pages 362-374
Fast Deterministic Algorithms for Matrix Completion Problems....Pages 375-386
Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines....Pages 387-398
Back Matter....Pages -