Efficacy of spacefilling heuristics in Euclidean combinatorial optimization

Efficacy of spacefilling heuristics in Euclidean combinatorial optimization

0.00 Avg rating0 Votes
Article ID: iaor19891005
Country: Netherlands
Volume: 8
Issue: 5
Start Page Number: 237
End Page Number: 239
Publication Date: Oct 1989
Journal: Operations Research Letters
Authors:
Keywords: programming: travelling salesman
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 d.

Reviews

Required fields are marked *. Your email address will not be published.