Sciweavers

GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
13 years 11 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
COCO
2006
Springer
113views Algorithms» more  COCO 2006»
13 years 11 months ago
On the Complexity of Numerical Analysis
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
Eric Allender, Peter Bürgisser, Johan Kjeldga...