Letter to the Editor---Graphic Solution of the Traveling-Salesman Problem

L. L. Barachet
Additional contact information
L. L. Barachet: Regie Nationale des Usines Renault, Billancourt, Seine, France

Operations Research, 1957, vol. 5, issue 6, 841-845

Abstract: The traveling-salesman problem consists in selecting from a total number of closed-circuit routes all passing through a number N of given points the one shortest route. To consider all the possible circuits would lead to excessive computations. However, this problem may be solved practically by using a simple, essentially intuitive method.

Date: 1957
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.5.6.841 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:5:y:1957:i:6:p:841-845

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().