Random tours in the traveling salesman problem: Analysis and application

Computational Optimization and Applications

Volumn 20, Issue 2, 2001, Pages 211-217

  Basel Iii, John ^a   Willemain, Thomas R ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Random optimization; Traveling salesman problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; RANDOM PROCESSES; SIMULATED ANNEALING; STATISTICAL METHODS;

COMBINATORIAL OPTIMIZATION; HEURISTIC SEARCH; RANDOM OPTIMIZATION; RANDOM TOURS;

TRAVELING SALESMAN PROBLEM;

EID: 0035501697     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011263204536     Document Type: Article

References (20)

1. A mean value analysis of the travelling repairman problem
2. The prize collecting traveling salesman problem
3. Estimating the length of the optimal traveling salesman tour from random tours
4. A new adaptive multi-start technique for combinatorial global optimizations
5. Operational estimators for the length of a traveling salesman tour
6. Sequential stopping rules for random optimization methods with applications to multistart local search
7. The traveling-salesman problem and minimum spanning trees
8. The traveling-salesman problem and minimum spanning trees, part II
9. Traveling salesman problem
10. Efficient global optimization of expensive black-box functions
11. The traveling salesman problem: A guided tour of combinatorial optimization
12. Heuristic random optimization
13. A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem
14. Sturdy statistics: Nonparametrics and order statistics
15. TSPLIB - A traveling salesman problem library
16. Probabilistic and worst case analysis of classical problems of combinatorial optimization in Euclidean space
17. Probability and problems in Euclidean combinatorial optimization
18. Optimal sequential sampling policy of partitioned random search and its applications
19. Estimating the Held-Karp lower bound for the geometric TSP
20. Stochastic methods for practical global optimization