Cover: On a linear programming-combinatorial approach to the traveling salesman problem

On a linear programming-combinatorial approach to the traveling salesman problem

Published 2004

by George Bernard Dantzig

Purchase Print Copy

 Format Price
Add to Cart Paperback13 pages $15.00

A more detailed description of the linear-programming approach in solving the traveling salesman problem that that presented in P-510. The present study considers the example discussed by L. L. Barachet ("Graphic Solution of the Traveling Salesman Problem," published in Operations Research, Vol. 5, 1957), in which he describes a procedure of successively improving a solution by using certain necessary conditions for optimality and indicates that there is no guarantee that the final tour obtained by his approach is optimal. In addition, this paper starts with Barachet's initial tour, improves it, and gives a proof that his final solution is indeed optimal.

This report is part of the RAND paper series. The paper was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.