2004

2004: IPCO X in New York, USA Website Program Committee: George Nemhauser, Georgia Institute of Technology (PC chair) Egon Balas, Carnegie Mellon University Daniel Bienstock, Columbia University Bob Bixby, Rice University William Cook, Georgia Institute of Technology Gerard Cornuejols, Carnegie Mellon University William Cunningham, University of Waterloo Bert Gerards, CWI Amsterdam Ravi Kannan, Yale University William Pulleyblank, IBM Watson Research Center Laurence A. Wolsey, Universite Catholique de Louvain List of accepted papers: N. Apollonio and A. Sebo. Minsquare factors and maxfix covers of graphs. P. Avella, S. Mattia and A. Sassano. Metric inequalities and the network loading problem. D. Bertsimas and A. Thiele. A robust optimization approach to supply chain management. S. Bessy and S. Thomasse. A proof of a conjecture of Gallai. G. Codato and M. Fischetti. Combinatorial Benders' cuts. J.R. Correa and A. Schulz. Single machine scheduling with precedence constraints. J.R. Correa, A. Schulz and N.E. Stier Moses. Computational complexity, fairness, and the price of anarchy of the maximum latency problem. S. Dash and O. Gunluk. Valid inequalities based on simple mixed-integer sets. I.R. de Farias, Jr. Semi-continuous cuts for mixed-integer programming. J.A. De Loera, D. Haws, R. Hemmecke, P. Huggins and R. Yoshida. Three kinds of integer programming algorithms based on Barvinok's rational functions. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan. Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems. S. Iwata, S. Moriguchi and K. Murota. A capacity scaling algorithm for M-convex submodular flow. V. Kaibel. Low-dimensional faces of random 0/1 polytopes. A.V. Karzanov. Integer concave cocirculations and honeycombs. T. Kiraly and M. Makai. On polyhedra defined by even factors. K. Lang and S. Rao. A flow-based method for improving the expansion or conductance of graph cuts. A.N. Letchford, G. Reinelt and D.O. Theis. A faster exact separation algorithm for blossom inequalities. A. Lodi, A. Frangioni and R. Rinaldi. Optimizing over semimetric polytopes. D. Lozovanu. Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games. T.L. Magnanti and D. Stratila. Separable concave optimization approximately equals piecewise linear optimization. J. Lee and F. Margot. More on a parsimonious coloring formulation. S. Onn and J. De Loera. All rational polytopes are transportation polytopes and all polytopal integer sets are contingency tables. G. Pap. A TDI description of the symmetric travelling salesman polytope. G. Perakis. The "Price of Anarchy" when costs are non-separable and asymmetric. R. Ravi and A. Sinha. Hedging uncertainty: approximation algorithms for stochastic optimization problems. A. Sebo and L. Szego. The path-packing structure of graphs. D. Shmoys. LP-based approximation algorithms for capacitated facility location. E. Asgeirsson, J. Berry, C. Phillips, D. Phillips, C. Stein and J. Wein. Scheduling an Industrial Production Facility. J. Vygen. Near-optimum global routing with coupling, delay bounds, and power consumption. R. Fukasawa, J. Lysgaard, M. Poggi de Aragao, M. Reis, E. Uchoa and R. Werneck. Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. A. Levin and G.J. Woeginger. The constrained minimum weighted sum of job completion times problem. J. Zhang. A multi-exchange local search algorithm for the capacitated facility location problem. B. Chen and Y. Ye. Title not clearly specified in the provided list.