1990
1990: IPCO I in Waterloo Program Committee: Vasek Chvatal, Rutgers University William H. Cunningham, Carleton University Ravi Kannan, Carnegie Mellon University Richard M. Karp, Berkeley George L. Nemhauser, Georgia Institute of Technology William R. Pulleyblank, University of Waterloo Paul D. Seymour, Bell Communications Research List of accepted papers: A.A. Ageev, V.L. Beresnev. Polynomially solvable cases of the simple plant location problem. E.J. Anderson, M.C. Ferris. A genetic algorithm for the assembly line balancing problem. N. Ascheuer, L. Escudero, M. Groetschel, M. Stoer. On identifying in polynomial time violated subtour elimination and precedence forcing constraints for the sequential ordering problem. F. Aurenhammer, J. Hagauer, W. Imrich. Factoring cartesian-product graphs at logarithmic cost per edge. E. Balas. Finding out whether a valid inequality is facet defining. D. Bienstock. Some provably hard crossing number problems. E.A. Boyd. Polyhedral results for the precedence-constrained knapsack problem. P.M. Camerini, G. Galbiati, F. Maffioli. Modular arithmetic and randomization for exact matroid problems. C.K. Cheng, T.C. Hu. Ancestor tree for arbitrary multi-terminal cut functions. S. Chopra, G. Rinaldi. The graphical asymmetric traveling salesman polyhedron. M. Conforti, G. Cornuejols. A decomposition theorem for balanced matrices. M. Deza, M. Laurent. New results on facets of the cut cone. E.A. Dinic. The fastest algorithm for the Pert problem with AND- and OR-nodes (The new-product-new-technology problem). M. Dyer, A. Frieze. Probabilistic analysis of the generalized assignment problem. J. Fonlupt, A. Sebo. On the clique-rank and coloration of perfect graphs. A. Frank. Conservative weightings and ear-decompositions of graphs. A.A. Fridman, E.V. Levner. A survey of some results in discrete optimisation. S. Hadley, F. Rendl, H. Wolkowicz. Bounds for the quadratic assignment problems using continuous optimization techniques. L.A. Hall, D.B. Shmoys. Near-optimal sequencing with precedence constraints. D.S. Hochbaum. On the impossibility of strongly polynomial algorithms for the allocation problem and its extensions. W. Hochstaettler. Shellability of oriented matroids. J.A. Hoogeveen. Minimizing maximum earliness and maximum lateness on a single machine. W.-L. Hsu. O(mn) isomorphism algorithms for circular-arc graphs and circle graphs. B. Jaumard, P. Hansen, M. Poggi de Aragao. Column generation methods for probabilistic logic. A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan, M.G.C. Resende. Computational experience with an interior point algorithm on the satisfiability problem. N. Karmarkar. An interior-point approach to NP-Complete problems. S. Khuller, J. Naor. Flow in planar graphs with vertex capacities. S. Onn. On the Radon number of the integer lattice. A. Recski, F. Strzyzewski. Vertex disjoint channel routing on two layers. B. Reed. Perfection, parity, planarity, and packing paths. M.H. Schneider. Max-balanced flows. A. Sebo. Hilbert bases, Caratheodory's theorem and combinatorial optimization. E.C. Sewell, L.E. Trotter Jr. Stability critical graphs and even subdivisions of K4. S. Sridhar, R. Chandrasekaran. Integer solution to synthesis of communication networks. M.A. Trick. Scheduling multiple variable-speed machines. S.L. van de Velde. Dual decomposition of single machine scheduling problems. V.V. Vazirani. A theory of alternating paths and blossoms for proving correctness of the O(√VE) general graph matching algorithm.