Complete linear descriptions of small asymmetric traveling salesman polytopes

DOI10.1016/0166-218X(95)98954-YzbMATH Open0838.90125OpenAlexW1976967559MaRDI QIDQ1900146FDOQ1900146

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The traveling salesman problem in graphs with 3-edge cutsets
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• Facets of the Asymmetric Traveling Salesman Polytope
• A note on small linear-ordering polytopes
• 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
• Title not available (Why is that?)
• On a composition of independence systems by circuit identification
• Title not available (Why is that?)
• Small Travelling Salesman Polytopes
• The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
• Complete linear descriptions of small asymmetric traveling salesman polytopes
• The facets of the asymmetric 5-city traveling salesman polytope

Cited In (5)

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

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)