An O(N log N) expected time merge heuristic for the planar ETSP.

Donald C. S. Allison Ritu Chadha

Published in: ACM Conference on Computer Science (1989)

Keyphrases

dynamic programming
simulated annealing
optimal solution
worst case
tabu search
search algorithm
lower bound
constraint satisfaction
combinatorial optimization
heuristic solution
planar surfaces
packing problem
expected outcome
data sets
line drawings
feasible solution
case study