Login / Signup
An O(N log N) planar travelling salesman heuristic based on spacefilling curves.
J. J. Bartholdi III
Loren K. Platzman
Published in:
Oper. Res. Lett. (1982)
Keyphrases
</>
travelling salesman
heuristic solution
projective transformations
lower bound
surface patches
worst case
b spline
branch and bound algorithm
optimal solution
evolutionary algorithm
special case
cost function
knapsack problem
curved surfaces