Complete linear descriptions of small asymmetric traveling salesman polytopes

DOI10.1016/0166-218X(95)98954-YMaRDI QIDQ1900146zbMATH OpenOpenAlexFDO

Authors Reinhardt Euler, Hervé Le Verge

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

zbMATH Keywords

facet-defining inequalitiesasymmetric traveling salesman polytopes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Recommendations

• A complete description of the traveling salesman polytope on 8 nodes
• Facets of the Asymmetric Traveling Salesman Polytope
• scientific article; zbMATH DE number 3943559
• The facets of the asymmetric 5-city traveling salesman polytope

Cites work

• scientific article; zbMATH DE number 3943559 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 17641 (Why is no real title available?)
• scientific article; zbMATH DE number 3609444 (Why is no real title available?)
• scientific article; zbMATH DE number 3078984 (Why is no real title available?)
• A complete description of the traveling salesman polytope on 8 nodes
• A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
• A note on small linear-ordering polytopes
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• Complete linear descriptions of small asymmetric traveling salesman polytopes
• Facets of the Asymmetric Traveling Salesman Polytope
• On a composition of independence systems by circuit identification
• Small Travelling Salesman Polytopes
• The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
• The facets of the asymmetric 5-city traveling salesman polytope
• The traveling salesman problem in graphs with 3-edge cutsets

Cited in

(5)

• A complete description of the traveling salesman polytope on 8 nodes
• Complete linear descriptions of small asymmetric traveling salesman polytopes
• Incremental convex hull algorithms are not output sensitive
• The facets of the asymmetric 5-city traveling salesman polytope
• Some applications of combinatorial optimization in parallel computing

This page was built for publication: Complete linear descriptions of small asymmetric traveling salesman polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900146)