A Lower Bound for Adjacencies on the Traveling Salesman Polytope

DOI10.1137/S0895480195283798zbMATH Open0895.68140OpenAlexW2090715877MaRDI QIDQ4377440FDOQ4377440

Authors: A. Sarangarajan 

Publication date: 9 February 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480195283798

Recommendations

• Some remarks on two degrees of asymmetry in the traveling salesman problem
• Faces with large diameter on the symmetric traveling salesman polytope
• Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope
• The monotonic diameter of traveling salesman polytopes

zbMATH Keywords

adjacencyasymmetric traveling salesman polytope

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Cited In (5)

• A new lower bound for the geometric traveling salesman problem in terms of discrepancy
• The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)
• The monotonic diameter of traveling salesman polytopes
• A normal fan projection algorithm for low-rank optimization
• An explicit lower bound for TSP with distances one and two

This page was built for publication: A Lower Bound for Adjacencies on the Traveling Salesman Polytope

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