Geometry, complexity, and combinatorics of permutation polytopes
Open Access
- 30 September 1993
- journal article
- Published by Elsevier BV in Journal of Combinatorial Theory, Series A
- Vol. 64 (1), 31-49
- https://doi.org/10.1016/0097-3165(93)90086-n
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the diameter of convex polytopesDiscrete Mathematics, 1992
- Fiber PolytopesAnnals of Mathematics, 1992
- Symmetric matroidsJournal of Combinatorial Theory, Series B, 1990
- The hirsch conjecture is true for (0, 1)-polytopesMathematical Programming, 1989
- Hamiltonicity in (0–1)-polyhedraJournal of Combinatorial Theory, Series B, 1984
- Convexity in oriented matroidsJournal of Combinatorial Theory, Series B, 1980
- Convex polyhedra of doubly stochastic matrices: II. Graph of ΩnJournal of Combinatorial Theory, Series B, 1977
- The travelling salesman problem and a class of polyhedra of diameter twoMathematical Programming, 1974
- On the Assignment PolytopeSiam Review, 1974
- Results and problems in the theory of doubly-stochastic matricesProbability Theory and Related Fields, 1963