Solution of a Large-Scale Traveling-Salesman Problem

  title={Solution of a Large-Scale Traveling-Salesman Problem},
  author={George B. Dantzig and Delbert Ray Fulkerson and Selmer M. Johnson},
  journal={Oper. Res.},
The RAND Corporation in the early 1950s contained “what may have been the most remarkable group of mathematicians working on optimization ever assembled” [6]: Arrow, Bellman, Dantzig, Flood, Ford, Fulkerson, Gale, Johnson, Nash, Orchard-Hays, Robinson, Shapley, Simon, Wagner, and other household names. Groups like this need their challenges. One of them appears to have been the traveling salesman problem (TSP) and particularly its instance of finding a shortest route through Washington, DC, and… 
Symmetric traveling salesman problem and flows in hypergraphs: New algorithmic possibilities
This work focuses on one compact formulation for the symmetric TSP, known as the “multistage insertion” formulation, and shows that its linear programming (LP) relaxation can be viewed as a minimum-cost flow problem in a hypergraph.
The Traveling Salesman Problem: Deceptivley Easy to State; Notoriously Hard to Solve
The purpose of this thesis is to give an overview of the history of the Traveling Salesman Problem and to show how it has been an integral part of the development of the fields of Integer
The indefinite period traveling salesman problem
It is shown that an optimal solution to the indefinite period traveling salesman problem may be a set of routes in which a given customer is grouped with a number of different subsets of customers rather than simply repeated TSP or multiple TSP optimal routes.
Approximation algorithms for traveling salesman problems based on linear programming relaxation
The traveling salesman problem (TSP) is the problem of finding a shortest Hamiltonian circuit or path in a given weighted graph. This problem has been studied in numerous variants, and linear
Geometric and LP-based heuristics for the quadratic travelling salesman problem
A wide range of heuristic approaches are introduced, motivated by the typical geometric structure of optimal solutions, and different improvement heuristics are proposed, most notably a matheuristic which locally reoptimizes the solution for rectangular sectors of the given point set by an ILP approach.
Using the TSP Solution for Optimal Route Scheduling in Construction Management
First descriptive formulation of the TSP can be found in a famous German handbook for traveling salesman from 1832 (Voigt, 1832) and the proposed 1832 German route might even be optimal.
Solution of a Min-Max Vehicle Routing Problem
This algorithmic framework combines the LP-based traveling salesman code of Applegate, Bixby, ChvAital, and Cook, with specialized cutting planes and a distributed search algorithm, permitting the use of a computing network located across Rice, Princeton, AT&T, and Bonn.
A Survey on Travelling Salesman Problem
The Travelling Salesman problem is one of the most popular problems from the NP set, it is also one of the hardest too. The solution to this problem enjoys wide applicability in a variety of
We consider a generalization of the classical traveling salesman problem (TSP) called the prece­ dence constrained traveling salesman problem (PCTSP), i.e. given a directed complete C(ll, E),
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
A polynomial size mixed-integer linear programming (MILP) formulation for the RATSP is introduced, and an existing exponential size ILP formulation of Zhu is improved, with results that under certain conditions, these two classes of stronger cuts are facet-defining forThe RATS polytope and that ATSP facets can be lifted, to give RAT SP facets.


On the Hamiltonian Game (A Traveling Salesman Problem)
Abstract : The purpose of this note is to give a method for solving a problem related to the traveling salesman problem. It seems worthwhile to give a description of the original problem. One
Application of the simplex method to a transportation problem, Activity Analysis of Production and Allocation (T.C
  • 1951