1996
1996: IPCO V in Vancouver, Canada Program Committee: William J. Cook, Rice University Gerard P. Cornuejols, Carnegie Mellon University William H. Cunningham, PC chair, University of Waterloo Jan Karel Lenstra, Technical University of Eindhoven Laszlo Lovasz, Yale University Thomas L. Magnanti, Massachusetts Institute of Technology Maurice Queyranne, University of British Columbia Giovanni Rinaldi, Istituto de Analisi dei Sistemi ed Informatica, Rome List of accepted papers: K. Anstreicher, M. Fampa, J. Lee, J. Williams. Continuous relaxations for constrained maximum entropy sampling. I. Barany, S. Onn. Colourful linear programming. C. Barnhart, C. Hane, P. Vance. Integer multicommodity flow problems. D.P. Bertsekas, P. Tseng. An epsilon-relaxation method for generalized separable convex cost network flow problems. D. Bertsimas, C. Teo, R. Vohra. On dependent randomized rounding algorithms. R.E. Burkard, E. Cela, G. Rote, G.J. Woeginger. The quadratic assignment problem with an anti-Monge and a Toeplitz matrix: easy and hard cases. R.E. Burkard, V.G. Deineko, G.J. Woeginger. The travelling salesman and PQ trees. A. Caprara, M. Fischetti, P. Toth. A heuristic algorithm for the set covering problem. B. Carr. Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time. H. Chen, A. Frieze. Coloring bipartite hypergraphs. S. Chopra, I. Gilboa, S.T. Sastry. Algorithms and extended formulations for one and two facility network design. E. Cohen. On optimizing multiplications of sparse matrices. S.P. Fekete, S. Khuller, M. Klemmstein, B. Raghvachari, N. Young. A network flow technique for finding low-weight bounded-degree spanning trees. L. Fleischer, E. Tardos. Separating maximally violated comb inequalities in planar graphs. M. Funke, G. Reinelt. A polyhedral approach to the feedback vertex set problem. M. Goemans. A supermodular relaxation for scheduling with release dates. M.X. Goemans, L.A. Hall. The strongest facets of the acyclic subgraph polytope are unknown. M.X. Goemans, D.P. Williamson. Primal-dual approximation algorithms for feedback problems in planar graphs. M.M. Halldorsson. Approximating k-set cover and complementary graph coloring. D. Hartvigsen. A submodular optimization problem with side constraints. C. Helmberg, F. Rendl, R. Weismantel. Quadratic knapsack relaxations using cutting planes and semidefinite programming. J.A. Hoogeveen, T. Kawaguchi. Minimizing total completion time in a two-machine flowshop: analysis of special cases. J.A. Hoogeveen, A.P.A. Vestjens. Optimal on-line algorithms for single-machine scheduling. N. Kahale. A semidefinite bound for mixing rates of Markov chains. S. Kapoor. On minimum 3-cuts and approximating k-cuts using cut trees. S.G. Kollipoulos, C. Stein. Finding real-valued single-source shortest paths in o(n^3) expected time. P. Martin, D.B. Shmoys. A new approach to computing optimal schedules for the job shop scheduling problem. K. Murota. Convexity and Steinitz's exchange property. B. Novick, A. Sebo. On ideal clutters, metrics and multiflows. G. Pataki. Cone-LP's and semidefinite programs: geometry, basic solutions and a simplex-type method. C. Roessner, C.P. Schnorr. An optimal, stable continued fraction algorithm for arbitrary dimension. A.S. Schulz. Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds. A.S. Schulz, R. Mueller. Transitive packing. N. Simonetti, E. Balas. Implementation of a linear time algorithm for certain generalized travelling salesman problems. C. Teo, D. Bertsimas. Improved randomized approximation algorithms for lotsizing problems. R. Thomas, R. Weismantel. Test sets and inequalities for integer programs.