Back to Search Start Over

AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM.

Authors :
Little, John D.C.
Murty, Katta G.
Sweeney, Dura W.
Karel, Caroline
Source :
Operations Research; Nov/Dec63, Vol. 11 Issue 6, p972-989, 18p
Publication Year :
1963

Abstract

Describes an algorithm for the traveling salesman problem. Breaking of the set of all tours into increasingly small subsets by a procedure called branching; Calculation of the lower bounds based on ideas frequently used in solving assignment problems.

Subjects

Subjects :
ALGORITHMS
TRAVELING salesman problem

Details

Language :
English
ISSN :
0030364X
Volume :
11
Issue :
6
Database :
Complementary Index
Journal :
Operations Research
Publication Type :
Academic Journal
Accession number :
7684068
Full Text :
https://doi.org/10.1287/opre.11.6.972
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details