The clustered traveling salesman problem
- 1 September 1975
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 2 (2) , 115-119
- https://doi.org/10.1016/0305-0548(75)90015-5
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Algorithms for Large-scale Travelling Salesman ProblemsJournal of the Operational Research Society, 1972
- An Upperbound Algorithm for the Single and Multiple Terminal Delivery ProblemManagement Science, 1972
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Some Methods of Producing Approximate Solutions to Travelling Salesman Problems with Hundreds or Thousands of CitiesJournal of the Operational Research Society, 1971
- An Algorithm for the Vehicle-dispatching ProblemJournal of the Operational Research Society, 1969
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman ProblemOperations Research, 1959
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954