Front matter
11-17
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo Reis and Eduardo Uchoa, et al.
401-421
Metric Inequalities and the Network Loading Problem
Pasquale Avella, Sara Mattia and Antonio Sassano
339-355
Valid Inequalities Based on Simple Mixed-Integer Sets
Sanjeeb Dash and Oktay Günlük
157-215
The Price of Anarchy when Costs Are Non-separable and Asymmetric
G. Perakis
59-73
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem
Extended Abstract
José R. Correa, Andreas S. Schulz and Nicolás E. Stier Moses
115-116
Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games
Dmitrii Lozovanu
145-156
A Robust Optimization Approach to Supply Chain Management
Dimitris Bertsimas and Aurélie Thiele
217-220
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
R. Ravi and Amitabh Sinha
47-80
Scheduling an Industrial Production Facility
Eyjolfur Asgeirsson, Jonathan Berry, Cynthia A. Phillips, David J. Phillips and Cliff Stein, et al.
5-20
Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs
Stéphane Bessy and Stéphan Thomassé
139-151
A TDI Description of Restricted 2-Matching Polytopes
Gyula Pap
169-273
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan
63-88
Semi-continuous Cuts for Mixed-Integer Programming
I. R. de Farias
29-46
Combinatorial Benders’ Cuts
Gianni Codato and Matteo Fischetti
19-52
A Faster Exact Separation Algorithm for Blossom Inequalities
Adam N. Letchford, Gerhard Reinelt and Dirk Oliver Theis
21-27
LP-based Approximation Algorithms for Capacitated Facility Location
Retsef Levi, David B. Shmoys and Chaitanya Swamy
1-4
A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem
Jiawei Zhang, Bo Chen and Yinyu Ye
19-31
Separable Concave Optimization Approximately Equals Piecewise Linear Optimization
Thomas L. Magnanti and Dan Stratila
3-9
Three Kinds of Integer Programming Algorithms Based on Barvinok’s Rational Functions
J. A. De Loera, D. Haws, R. Hemmecke, P. Huggins and R. Yoshida
131-143
The Path-Packing Structure of Graphs
András Sebő and László Szegő
119-130
More on a Binary-Encoded Coloring Formulation
Jon Lee and François Margot
145-168
Single Machine Scheduling with Precedence Constraints
José R. Correa and Andreas S. Schulz
53-143
The Constrained Minimum Weighted Sum of Job Completion Times Problem
Asaf Levin and Gerhard J. Woeginger
33-41
Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption
Jens Vygen
383-400
A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts
Kevin Lang and Satish Rao
89-101
All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables
Jesus De Loera and Shmuel Onn
43-61
A Capacity Scaling Algorithm for M-convex Submodular Flow
Satoru Iwata, Satoko Moriguchi and Kazuo Murota
368-387
Integer Concave Cocirculations and Honeycombs
Alexander V. Karzanov
1-2
Minsquare Factors and Maxfix Covers of Graphs
Nicola Apollonio and András Sebő
103-118
Low-Dimensional Faces of Random 0/1-Polytopes
Volker Kaibel
275-337
On Polyhedra Related to Even Factors
Tamás Király and Márton Makai
357-382
Optimizing over Semimetric Polytopes
Antonio Frangioni, Andrea Lodi and Giovanni Rinaldi
Back matter