Back to Results
First PageMeta Content
Travelling salesman problem / Operations research / Mathematical optimization / Combinatorial optimization / Computational complexity theory / Lin–Kernighan heuristic / Genetic algorithm / Simulated annealing / Search algorithm / Mathematics / Applied mathematics / Theoretical computer science


An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP Dan Bonachea Computer Science Dept. University of California
Add to Reading List

Document Date: 2004-11-10 21:04:25


Open Document

File Size: 580,33 KB

Share Result on Facebook
UPDATE