default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Polyhedral Combinatorics 1990
- William J. Cook, Paul D. Seymour:
Polyhedral Combinatorics, Proceedings of a DIMACS Workshop, Morristown, New Jersey, USA, June 12-16, 1989. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 1, DIMACS/AMS 1990, ISBN 978-0-8218-6591-0 - László Lovász, Alexander Schrijver:
Matrix Cones, Projection Representations, and Stable Set Polyhedra. 1-18 - Giri Narasimhan, Rachel Manber:
A Generalization of Lovasz's 0_ Function. 19-28 - Albertus M. H. Gerards:
On Cutting Planes and Matrices. 29-32 - Martin E. Dyer, Zoltán Füredi, Colin McDiarmid:
Random Volumes in the n-Cube. 33-38 - Ravi Kannan:
Test Sets for Integer Programs, 0_ Sentences. 39-48 - Santosh N. Kabadi, Ramaswamy Chandrasekaran:
Solvable Classes of Generalized Traveling Salesman Polytope. 49-60 - Denis Naddef:
Handles and Teeth in the Symmetric Traveling Salesman Problems. 61-74 - William J. Cook, Mark Hartmann:
On the Complexity of Branch and Cut Methods for the Traveling Salesman Problem. 75-82 - Kathie Cameron, Jack Edmonds:
Existentially Polytime Theorems. 83-100 - Alfred Lehman:
The Width-Length Inequality and Degenerate Projective Planes. 101-106 - Paul D. Seymour:
On Lehman's Width-Length Characterization. 107-118 - Alexander Schrijver:
Applications of Polyhedral Combinatorics to Multicommodity Flowsand Compact Surfaces. 119-138 - András Frank, Alexander Schrijver:
Vertex-Disjoint Simple Paths of Given Homotopy in a Planar Graph. 139-162 - András Frank:
On Disjoint Homotopic Paths in the Plane. 163-170 - Matthias Middendorf, Frank Pfeiffer:
On the Complexity of the Disjoint Paths Problem (Extended Abstract). 171-178 - Matthias Middendorf, Frank Pfeiffer:
The Paths-Selection. 179-188 - Francisco Barahona:
Planar Multicommodity Flows, Max Cut, and the Chinese Postman Problem. 189-202 - András Sebö:
The Cographic Multiflow Problem: An Epilogue. 203-234 - Odile Marcotte:
Exact Edge-Colorings of Graphs without Prescribed Minors. 235-244 - Odile Marcotte:
On the Chromatic Index of Multigraphs and a Conjecture of Seymour, (II). 245-280 - Alexander Schrijver, Paul D. Seymour:
Spanning Trees of Different Weights. 281-
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-05 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
