1995
1995: IPCO IV in Copenhagen, Denmark Program Committee: Egon Balas, PC chair, Carnegie Mellon University Rainer E. Burkard, TU Graz Jens Clausen, University of Copenhagen Matteo Fischetti, University of Padova William R. Pulleyblank, IBM Watson Research Center Carsten Thomassen, University of Denmark Joergen Tind, University of Copenhagen List of accepted papers: A.A. Ageev, A.V. Kostochka, Z. Szigeti. A Characterization of Seymour Graphs. A.I. Ali, H.-S. Han, J.L. Kennington. Use of Hidden Network Structure in the Set Partitioning Problem. I. Barany, H.E. Scarf, D. Shallcross. The Topological Structure of Maximal Lattice Free Convex Bodies: The m by n Case. E. Bartels, D. Welsh. The Markov Chain of Colourings. D. Bertsimas, C. Teo, R. Vohra. Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems. D. Bienstock. Computational Study of a Family of Mixed-Integer Quadratic Programming Problems. A. Bouchet. Coverings and Delta-Coverings. R. Carr. Separating Clique Trees and a Major Class of Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time. S. Ceria, G. Cornuejols, M. Dawande. Optimizing Generalized Gomory Cuts for Pure and Mixed Integer Programs. E. Cheng, W.H. Cunningham. Separation Problems for the Stable Set Polytope. B.V. Cherkassky, A.V. Goldberg. On Implementing Push-Relabel Methods for the Maximum Flow Problem. M. Conforti, G. Cornuejols, A. Kapoor, K. Vuskovic. A Mickey-Mouse Decomposition Theorem. Y. Crama, F.C.R. Spieksma. Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results. G. Dahl. Polyhedra and Optimization in Connection with a Weak Majorization Ordering. X. Deng. Distributed Near-Optimal Matching. L.F. Escudero, S. Martello and P. Toth. A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems. G. Even, J. Naor, B. Schieber, M. Sudan. Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. A. Frank, T. Jordan. How to Make a Strongly Connected Digraph Two-Connected. A. Frieze, M. Jerrum. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. H.N. Gabow, K.S. Manu. Packing Algorithms for Arborescences in Capacitated Graphs. Z. Gu, G.L. Nemhauser, M.W.P. Savelsbergh. Sequence Independent Lifting of Cover Inequalities. D. Hartvigsen. Generalized Max Flows and Augmenting Paths. C. Helmberg, S. Poljak, F. Rendl, H. Wolkowicz. Combining Semidefinite and Polyhedral Relaxations for Integer Programs. J.A. Hoogeveen, S.L. van de Velde. Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times. S. Hosten, B. Sturmfels. GRIN: An Implementation of Groebner Bases for Integer Programming. M. Juvan, J. Marincek, B. Mohar. Embedding a Graph into the Torus in Linear Time. P. Kleinschmidt, S. Onn. Oriented Matroid Polytopes and Polyhedral Fans are Signable. B. Klinz, G.J. Woeginger. Minimum Cost Dynamic Flows: The Series-Parallel Case. F. Laburthe. The Hilbert Basis of the Cut Cone for the Complete Graph K6. R. Mueller, A.S. Schulz. The Interval Order Polytope of a Digraph. H. Nagamochi, T. Ibaraki. A Faster Edge Splitting Algorithm in Multigraphs and its Application to the Edge-Connectivity Augmentation Problem. P. Nobili, A. Sassano. (0,+-1) Ideal Matrices. B. Novick, A. Sebo. On Combinatorial Properties of Binary Spaces. U. Pferschy. The Random Linear Bottleneck Assignment Problem. D. Pisinger. A Minimal Algorithm for the Bounded Knapsack Problem. M. Queyranne, A.S. Schulz. Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds.