![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 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](https://www.pdfsearch.io/img/9ba04829eb7cce693ac58f7e45223334.jpg) Date: 2004-11-10 21:04:25Travelling 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 CaliforniaAdd to Reading ListSource URL: www.cs.berkeley.eduDownload Document from Source Website File Size: 580,33 KBShare Document on Facebook
|