The monotonic diameter of traveling salesman polytopes

Authors:
Fred J. Rispoli
Affiliations:
Department of Mathematics, Dowling College, Oakdale, NY 11769, USA
Venue:
Operations Research Letters
Year:
1998

Citing 7
Cited 0

The d-step conjecture and its relatives

Mathematics of Operations Research
Signature classes of transportation polytopes

Mathematical Programming: Series A and B
Adjacency on combinatorial polyhedra

Discrete Applied Mathematics - Special issue: Fifth Franco-Japanese Days, Kyoto, October 1992
Convex polytopes and related complexes

Handbook of combinatorics (vol. 1)
A Bound of 4 for the Diameter of the Symmetric Traveling Salesman Polytope

SIAM Journal on Discrete Mathematics
The monotonic diameter of the perfect matching and shortest path polytopes

Operations Research Letters
Faces with large diameter on the symmetric traveling salesman polytope

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The monotonic diameter of the polytopes arising in the asymmetric and the symmetric traveling salesman problem (TSP) are obtained. For the asymmetric TSP polytope associated with the complete directed graph on n nodes, the monotonic diameter is shown to be exactly @?n/3@?, for all n=3. For the symmetric TSP polytope associated with the complete undirected graph on n nodes, the monotonic diameter is shown to be exactly @?n/2@?-1, for all n=3, except for n=5, in which case it is @?n/2@?.