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

Volume

2

Issue

4

Pages

393-410

DOI registrant

Institute for Operations Research and the Management Sciences

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

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

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