A statistical approach to the tsp
From MaRDI portal
Publication:4182284
Cites work
- A man-machine approach toward solving the traveling salesman problem
- Computer Solutions of the Traveling Salesman Problem
- scientific article; zbMATH DE number 3141621 (Why is no real title available?)
- scientific article; zbMATH DE number 3304538 (Why is no real title available?)
- Implementing vehicle routing algorithms
Cited in
(13)- Randomized algorithms in combinatorial optimization: A survey
- A computational evaluation of optimal solution value estimation procedures
- Probabilistic analysis of solving the assignment problem for the traveling salesman problem
- Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- Semi-greedy heuristics: An empirical study
- Heuristic methods and applications: A categorized survey
- Approximation algorithms with constant ratio for general cluster routing problems
- Dividing a territory among several vehicles
- A heuristic approximation of the worst case of Shellsort
- Point estimation of a global optimum for large combinatorial problems
- Continuous approximation formulas for location problems
- Curse of scale-freeness: intractability of large-scale optimization with multi-start methods
This page was built for publication: A statistical approach to the tsp
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4182284)