On the Solution of Traveling Salesman

@inproceedings{Applegate1998OnTS,
  title={On the Solution of Traveling Salesman},
  author={P M Applegate and Robert Bixby and W. Cook},
  year={1998}
}
Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulk-erson, and S.M. Johnson demonstrated in 1954 that large instances of the TSP could be solved by linear programming. Their approach remains the only known tool for solving TSP instances with more than several hundred cities; over the years, it has evolved further through the work of and others. We enumerate some of its reenements that led to the solution of a 13,509-city… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

On implementing the pushrelabel method for the maximum ow problem "

  • A. V. Goldberg
  • 1997

\ On certain convex polyhedra " , Abstract 799 t

  • A. H. G. Rinnooy Kan, D. B. Shmoys
  • Bulletin ofthe American Mathematical Society
  • 1972

Padberg , \ Solving large - scale symmetric travelling salesman problems to optimality "

  • W. M.
  • MathematicalProgramming

Similar Papers

Loading similar papers…