Complete linear descriptions of small asymmetric traveling salesman polytopes
From MaRDI portal
Publication:1900146
DOI10.1016/0166-218X(95)98954-YzbMath0838.90125OpenAlexW1976967559MaRDI QIDQ1900146
Hervé Le Verge, Reinhardt Euler
Publication date: 17 October 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(95)98954-y
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a composition of independence systems by circuit identification
- A complete description of the traveling salesman polytope on 8 nodes
- Complete linear descriptions of small asymmetric traveling salesman polytopes
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
- A note on small linear-ordering polytopes
- The traveling salesman problem in graphs with 3-edge cutsets
- The facets of the asymmetric 5-city traveling salesman polytope
- Facets of the Asymmetric Traveling Salesman Polytope
- Small Travelling Salesman Polytopes
- The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
This page was built for publication: Complete linear descriptions of small asymmetric traveling salesman polytopes
