1993
1993: IPCO III in Erice, Italy Program Committee: Gerard P. Cornuejols, Carnegie Mellon University Martin Dyer, University of Leeds Andras Frank, Eoetvoes Lorand University and Bonn University Jan Karel Lenstra, Technical University of Eindhoven Kurt Mehlhorn, University of Saarbruecken Giovanni Rinaldi, Istituto de Analisi dei Sistemi ed Informatica, Rome Eva Tardos, Cornell University Laurence A. Wolsey, Universite Catholique de Louvain (PC chair) List of accepted papers: F. Avram, D. Bertsimas. On a characterization of the minimum assignment and matching in the independent random model. E. Balas, M. Fischetti. On the monotonization of polyhedra. I. Barany, R. Howe, H.E. Scarf. The complex of maximal lattice free simplices. D. Bertsimas, J. Nino-Mora. Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to indexable systems. E.A. Boyd. Solving integer programs with Fenchel cutting planes and preprocessing. J.M. Clochard, D. Naddef. Using path inequalities in a branch and cut code for the symmetric travelling salesman problem. R.F. Cohen, S. Sairam, R. Tamassia, J.S. Vitter. Dynamic algorithms for optimization problems in bounded tree-width graphs. H.N. Gabow, M.X. Goemans, D.P. Williamson. An efficient approximation algorithm for the survivable network design problem. A. Galluccio, M. Loebl. Cycles of prescribed modularity in planar digraphs. N. Garg, V.V. Vazirani. A polyhedron with all s-t cuts as vertices, and adjacency of cuts. M.X. Goemans, D.P. Williamson. A new 3/4-approximation algorithm for MAX SAT. A.V. Goldberg. An efficient implementation of a scaling minimum cost-flow algorithm. F. Granot, M. Penn. On the (integral) maximum two-flow in vertex and edge capacitated planar graphs. M. Groetschel, A. Martin, R. Weismantel. Routing in grid graphs by cutting planes. C. Helmberg, B. Mohar, S. Poljak, F. Rendl. A spectral approach to bandwidth and separator problems in graphs. J.A. Hoogeveen, S.L. van de Velde. Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. M. Jerrum. An analysis of a Monte Carlo algorithm for estimating the permanent. T. Jordan. Optimal and almost optimal algorithms for connectivity augmentation problems. M. Juenger, P. Mutzel. Solving the maximum weight planar subgraph. R. Kannan. Optimal solution and value of parametric integer programs. H. Kellerer, F. Rendl, G.J. Woeginger. Computing the optimum stock size. S. Khuller, U. Vishkin, N. Young. A primal-dual parallel approximation technique applied to weighted set and vertex cover. P. Klein, R. Ravi. When cycles collapse: A general approximation technique for constrained two-connectivity problems. P. Klein, R. Ravi. A nearly best-possible approximation algorithm for node-weighted Steiner trees. M. Lomonosov, A. Sebo. On the geodesic structure of graphs: a polyhedral approach to metric decomposition. S.T. McCormick, T.R. Ervolina. Canceling most helpful total submodular cuts for submodular flow. R. Mueller. On the transitive acyclic subdigraph polytope. M. Nakamura. Delta-polymatroids and an extension of the Edmonds-Giles TDI scheme. S. Nakano, T. Nishizeki. Nearly uniform scheduling of file transfers. W.R. Pulleyblank, F.B. Shepherd. Formulations for the stable set polytope of a claw-free graph. M. Queyranne, F.C.R. Spieksma, F. Tardella. A general class of greedily solvable linear programs. A. Sebo. Circuit packings on surfaces with at most three cross-caps. Z. Szigeti. On Lovasz's cathedral theorem. A. Zelikovsky. An approximation algorithm for weighted k-polymatroids and the Steiner tree problem in graphs. X. Zhou, H. Suzuki, T. Nishizeki. Sequential and parallel algorithms for edge-coloring series-parallel multigraphs.