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

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 p...

Full description

Saved in:
Bibliographic Details
Published inOperations research Vol. 7; no. 1; pp. 58 - 66
Main Authors Dantzig, G. B, Fulkerson, D. R, Johnson, S. M
Format Journal Article
LanguageEnglish
Published Baltimore, Md INFORMS 01.01.1959
Operations Research Society of America
Subjects
Combinatorial analysis
Linear programming
Simplex method
Zero
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.7.1.58