The noisy euclidean traveling salesman problem and learning

Advances in Neural Information Processing Systems

Volumn , Issue , 2002, Pages

  Braun, Mikio L ^a   Ruhmann, Joachim M ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

TRAJECTORIES;

EUCLIDEAN; GIBBS SAMPLING; LEARNING SETTINGS; OVERFITTING; RANDOM COMBINATORIAL PROBLEMS;

TRAVELING SALESMAN PROBLEM;

EID: 0141687774     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. J. M. Buhmann and M. Held. Model selection in clustering by uniform convergence bounds. Advances in Neural Information Processing Systems, 12:216-222, 1999.
2. R. Durbin and D. Willshaw. An analogue approach to the travelling salesman problem using an elastic net method. Nature, 326:689-691, 1987.
3. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimisation by simulated annealing. Science, 220:671-680, 1983.
4. S. Lin and B. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21:498-516, 1973.
5. P.D. Simic. Statistical mechanics as the underlying theory of elastic and neural optimizations. Network, 1:89-103, 1990.
6. G. Winkler. Image Analysis, Random fields and Dynamic Monte Carlo Methods, volume 27 of Application of Mathematics. Springer, Heidelberg, 1995.