Method of scaling in approximate solution of the traveling salesman problem
From MaRDI portal
Publication:2392635
DOI10.1134/S0005117911120083zbMath1273.90242MaRDI QIDQ2392635
Publication date: 2 August 2013
Published in: Automation and Remote Control (Search for Journal in Brave)
Uses Software
Cites Work
- Unnamed Item
- The traveling salesman problem. Approximate algorithms
- The traveling salesman problem. I: Theoretical issues
- The traveling salesman problem. II: Exact methods
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Estimating the Held-Karp lower bound for the geometric TSP
- A heuristic for the pickup and delivery traveling salesman problem
- The traveling salesman problem and its variations.
- One generalization of the traveling salesman problem. I
- A Dynamic Programming Approach to Sequencing Problems
- 8/7-approximation algorithm for (1,2)-TSP
This page was built for publication: Method of scaling in approximate solution of the traveling salesman problem