Polyhedral combinatorics : proceedings of a DIMACS workshop : June 12-16, 1989 /
Saved in:
| Meeting name: | DIMACS Workshop on Polyhedral Combinatorics (1989 : Center for Discrete Mathematics and Theoretical Computer Science) |
|---|---|
| Imprint: | Providence, RI : American Mathematical Society ; [New York] : Association for Computing Machinery, c1990. |
| Description: | xii, 288 p. : ill. ; 26 cm. |
| Language: | English |
| Series: | DIMACS series in discrete mathematics and theoretical computer science v. 1 |
| Subject: | |
| Format: | Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/1113553 |
Table of Contents:
- Matrix cones, projection representations, and stable set polyhedra
- A generalization of Lovasz's $\theta$ function
- On cutting planes and matrices
- Random volumes in the $n$-cube
- Test sets for integer programs, $\forall \exists$ sentences
- Solvable classes of generalized traveling salesman problems
- Handles and teeth in the symmetric traveling salesman polytope
- On the complexity of branch and cut methods for the traveling salesman problem
- Existentially polytime theorems
- The width-length inequality and degenerate projective planes
- On Lehman's width-length characterization
- Applications of polyhedral combinatorics to multicommodity flows and compact surfaces
- Vertex-disjoint simple paths of given homotopy in a planar graph
- On disjoint homotopic paths in the plane
- On the complexity of the disjoint paths problem (extended abstract)
- The paths-selection problem
- Planar multicommodity flows, max cut, and the Chinese postman problem
- The cographic multiflow problem: An epilogue
- Exact edge-colorings of graphs without prescribed minors
- On the chromatic index of multigraphs and a conjecture of Seymour, (II)
- Spanning trees of different weights
