Equidistribution in all Dimensions of Worst-case Point Sets for the Traveling Salesman Problem

DOI10.1137/S0895480194262710MaRDI QIDQ4863984zbMATH OpenOpenAlexFDO

Authors Timothy Law Snyder, J. Michael Steele

Publication date 15 September 1996

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

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

zbMATH Keywords

Steiner minimum treeoptimal traveling salesman tour

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 437572
• scientific article; zbMATH DE number 4167872
• On the Travelling Salesperson Problem in Many Dimensions
• On the length of optimal TSP circuits in sets of bounded diameter
• A Priori Bounds on the Euclidean Traveling Salesman

Cited in

(6)

• Quantizers ad the worst case Euclidean traveling salesman problem
• Bounds for the traveling salesman paths of two-dimensional modular lattices
• Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
• The physicist's approach to the travelling salesman problem
• Worst-case demand distributions in vehicle routing
• scientific article; zbMATH DE number 437572 (Why is no real title available?)

This page was built for publication: Equidistribution in all Dimensions of Worst-case Point Sets for the Traveling Salesman Problem

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