A heuristic algorithm for traveling salesman problems
- 30 June 1972
- journal article
- research article
- Published by Elsevier in Transportation Research
- Vol. 6 (2) , 187-195
- https://doi.org/10.1016/0041-1647(72)90051-2
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Branch-and-Bound Algorithm for Flow Shop Scheduling ProblemsA I I E Transactions, 1970
- Direct search algorithms for truck-dispatching problemsTransportation Research, 1969
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964
- A Heuristic Approach to Solving Travelling Salesman ProblemsManagement Science, 1964
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- Dynamic Programming Treatment of the Travelling Salesman ProblemJournal of the ACM, 1962
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960
- 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