Solution of a large-scale traveling-salesman problem

Dantzig, G. B., Fulkerson, & Johnson, S. M. (1954). Solution of a large-scale traveling-salesman problem. Operations Research, 2(4), 393-410.

Type

Journal article

Intellectual base

Primary research

Year

1954

Link

https://doi.org/10.1287/opre.2.4.393verified

Cited from

operations_research

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Integer Linear Programming (ILP)
  • Dantzig, Fulkerson, and Johnson's (1954) solution of the 49-city traveling-salesman problem via cutting-plane methods demonstrated the approach in practice.

    This sourceSolves a 49-city TSP by hand-iterated cutting planes on an LP formulation; foundational demonstration that hard combinatorial problems yield to LP-based attack.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:36887fa8b02b · see in the full table