Egon Balas, Gérard Cornuéjols, Ravi Kannan (Eds.):
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, May 1992.
Carnegie Mellon University 1992
Michel X. Goemans: Polyhedral Description of Trees and Arborescences.
1-14
Sunil Chopra: The K-Edge Connected Spanning Subgraph Polyhedron.
15-29
Farhad Shahrokhi, László A. Székely: Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry.
102-113
Cor A. J. Hurkens: Nasty TSP Instances for Farthest Insertion.
346-352
András Sebö: Forcing Colorations and the Strong Perfect Graph Conjecture.
353-366
Lov K. Grover: Fast Parallel Algorithms for Bipartite Matching.
367-384
Farid Alizadeh: Combinatorial Optimization with Semi-Definite Matrices.
385-405
Narendra Karmarkar, S. A. Thakur: An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems.
406-420
Daniel Bienstock: A Lot-Sizing Problem on Trees, Related to Network Design.
421-434
data released under the ODC-BY 1.0 license
