A Lower Bound for Adjacencies on the Traveling Salesman Polytope

DOI10.1137/S0895480195283798zbMath0895.68140OpenAlexW2090715877MaRDI QIDQ4377440

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

zbMATH Keywords

adjacencyasymmetric traveling salesman polytope

Mathematics Subject Classification ID

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

Related Items (1)

The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)

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