Efficacy of spacefilling heuristics in Euclidean combinatorial optimization

Authors:
J. Michael Steele
Affiliations:
Program in Statistics and Operations Research, School of Engineering and Applied Science, Princeton University, Princeton, NJ 08544, USA
Venue:
Operations Research Letters
Year:
1989

Citing 3
Cited 0

Heuristics based on spacefilling curves for combinatorial problems in Euclidean space

Management Science
Spacefilling curves and the planar travelling salesman problem

Journal of the ACM (JACM)
Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note sharpens and generalizes an inequality of Platzman and Bartholdi on the ratio of the cost of the path provided by the spacefilling heuristic to the cost of the optimal path through n points in R^d.