Dynamic Programming Treatment of the Travelling Salesman Problem

Bellman, R. (1962). Dynamic Programming Treatment of the Travelling Salesman Problem. ACM.

Type

Book chapter

Intellectual base

Review or monograph

Year

1962

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Held–Karp algorithm
  • The Bellman–Held–Karp algorithm solves TSP exactly by computing the minimum cost of a path from a fixed start through every vertex in a subset and ending at a specified vertex, then closing the best full path into a tour.

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:9f578006c10e · see in the full table