A search algorithm for the traveling salesman problem
- 31 December 1978
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 5 (4) , 243-250
- https://doi.org/10.1016/0305-0548(78)90033-3
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A search algorithm for the generalized flowshop scheduling problemComputers & Operations Research, 1975
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Some Methods of Producing Approximate Solutions to Travelling Salesman Problems with Hundreds or Thousands of CitiesJournal of the Operational Research Society, 1971
- A Branch Search Algorithm for the Knapsack ProblemManagement Science, 1970
- The Traveling Salesman Problem: A SurveyOperations Research, 1968
- A GENERAL ALGORITHM FOR THEn × MFLOWSHOP SCHEDULING PROBLEM†International Journal of Production Research, 1968
- Letter to the Editor—Some Observations on the Longest Path ProblemOperations Research, 1964
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- On the Relation Between the Traveling-Salesman and the Longest-Path ProblemsOperations Research, 1962