----------------------------------------------------------------
IPCO X, 2004 (New York): List of accepted papers
----------------------------------------------------------------
Minsquare factors and maxfix covers of graphs
N. Apollonio and A. Sebo
Metric inequalities and the network loading problem
P. Avella, S. Mattia and A. Sassano
A robust optimization approach to supply chain management
D. Bertsimas and A. Thiele
Three min-max theorems concerning cyclic orders of strong digraphs
A proof of a conjecture of Gallai
S. Bessy and S. Thomasse
Combinatorial Benders' cuts
G. Codato and M. Fischetti
Single machine scheduling with precedence constraints
J.R. Correa and A. Schulz
Computational complexity, fairness, and the price of anarchy of the maximum
latency problem
J.R. Correa, A. Schulz and N.E. Stier Moses
Valid inequalities based on simple mixed-integer sets
S. Dash and O. Gunluk
Semi-continuous cuts for mixed-integer programming
I.R. de Farias, Jr.
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
Enumerating minimal dicuts and strongly connected subgraphs and related
geometric problems
E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan
A capacity scaling algorithm for M-convex submodular flow
S. Iwata, S. Moriguchi and K. Murota
Low-dimensional faces of random 0/1 polytopes
V. Kaibel
Integer concave cocirculations and honeycombs
A.V. Karzanov
On polyhedra defined by even factors
T. Kiraly and M. Makai
A flow-based method for improving the expansion or conductance of graph cuts
K. Lang and S. Rao
A faster exact separation algorithm for blossom inequalities
A.N. Letchford, G. Reinelt and D.O. Theis
Optimizing over semimetric polytopes
A. Lodi, A. Frangioni and R. Rinaldi
Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games
D. Lozovanu
Separable concave optimization approximately equals piecewise linear
optimization
T.L. Magnanti and D. Stratila
J. Lee and F. Margot
More on a parsimonious coloring formulation
All rational polytopes are transportation polytopes and all polytopal integer
sets are contingency tables
S. Onn and J. De Loera
A TDI description of the symmetric travelling salesman polytope
G. Pap
The "Price of Anarchy" when costs are non-separable and asymmetric
G. Perakis
Hedging uncertainty: approximation algorithms for stochastic optimization
problems
R. Ravi and A. Sinha
The path-packing structure of graphs
A. Sebo and L. Szego
LP-based approximation algorithms for capacitated facility location
D. Shmoys
Scheduling an Industrial Production Facility
E. Asgeirsson, J. Berry, C. Phillips, D. Phillips, C. Stein and J. Wein
Near-optimum global routing with coupling, delay bounds, and power consumption
J. Vygen
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
R. Fukasawa, J. Lysgaard, M. Poggi de Aragao, M. Reis, E. Uchoa and
R. Werneck
The constrained minimum weighted sum of job completion times problem
A. Levin and G.J. Woeginger
A multi-exchange local search algorithm for the capacitated facility
location problem
J. Zhang B. Chen and Y. Ye