Efficacy of spacefilling heuristics in Euclidean combinatorial optimization

DOI10.1016/0167-6377(89)90046-1zbMath1418.90241OpenAlexW1967351698MaRDI QIDQ2314405

J. Michael Steele

Publication date: 22 July 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90046-1

zbMATH Keywords

traveling salesman problemLipschitz mappingsspacefilling curvesdimension increasing mappings

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• Conservative confidence bands in curvilinear regression
• On Hotelling's formula for the volume of tubes and Naiman's inequality
• Peano curves and smoothness of functions
• Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
• Spacefilling curves and the planar travelling salesman problem
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space

This page was built for publication: Efficacy of spacefilling heuristics in Euclidean combinatorial optimization