Login / Signup
The Parallel Complexity of TSP Heuristics.
Gerard A. P. Kindervater
Jan Karel Lenstra
David B. Shmoys
Published in:
J. Algorithms (1989)
Keyphrases
</>
traveling salesman problem
search algorithm
parallel processing
computational complexity
neural network
optimal solution
search space
computational cost
combinatorial optimization
general purpose
constraint satisfaction problems
heuristic search