Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach
From MaRDI portal
Publication:3217446
Recommendations
- scientific article; zbMATH DE number 3950233
- Random tours in the traveling salesman problem: Analysis and application
- The traveling salesman problem. Approximate algorithms
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation
- On the Significance of the Initial Solution in Travelling Salesman Heuristics
Cites work
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Approximate Traveling Salesman Algorithms
- Approximative Algorithms for Discrete Optimization Problems
- Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
- scientific article; zbMATH DE number 3841064 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3307087 (Why is no real title available?)
- scientific article; zbMATH DE number 3338262 (Why is no real title available?)
- Integer programming approaches to the travelling salesman problem
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
Cited in
(5)- On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
- Heuristic methods and applications: A categorized survey
- A study on the effects of normalized TSP features for automated algorithm selection
- scientific article; zbMATH DE number 3950233 (Why is no real title available?)
- Random tours in the traveling salesman problem: Analysis and application
This page was built for publication: Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217446)