On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem

G. B. Dantzig, D. R. Fulkerson and S. M. Johnson
Additional contact information
G. B. Dantzig: The Rand Corporation, Santa Monica, California
D. R. Fulkerson: The Rand Corporation, Santa Monica, California
S. M. Johnson: The Rand Corporation, Santa Monica, California

Operations Research, 1959, vol. 7, issue 1, 58-66

Abstract: This paper elaborates a method of attack on traveling-salesman problems, proposed by the authors in an earlier paper, in which linear programming is used to reduce the combinatorial magnitude of such problems. To illustrate the method, a step-by-step solution of Barachet's ten-city example is presented.

Date: 1959
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.7.1.58 (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:7:y:1959:i:1:p:58-66

Access Statistics for this article

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