Geometric Approaches to Solving the Traveling Salesman Problem
From MaRDI portal
Cited in
(7)- An improved heuristic for the capacitated arc routing problem
- Linear facility location. Solving extensions of the basic problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- Heuristic methods and applications: A categorized survey
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation
- A diagonal completion and 2-optimal procedure for the travelling salesman problem
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
This page was built for publication: Geometric Approaches to Solving the Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152355)