A dynamic programming approach to sequencing problems

Held, M., & Karp, R. M. (1962). A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics, 10(1), 196-210.

Type

Journal article

Intellectual base

Primary research

Year

1962

DOI

10.1137/0110015

Link

https://doi.org/10.1137/0110015

Cited from

operations_research

Cited by

3 citations across 3 artifacts.

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

Primes

• Dynamic Programming
  • Held-Karp's algorithm (1962) and Dijkstra's shortest-path method (1959) exemplify the computational leverage of DP-based formulations.

    This sourceIntroduces the Held–Karp algorithm for exact traveling-salesman-problem solution via DP with bitmask state compression

• Resource Management

  • This sourceIntroduces the Held–Karp algorithm for exact traveling-salesman-problem solution via DP with bitmask state compression; canonical example of state-space-compression DP for small-instance combinatorial optimization.

Domain-specific

• Held–Karp algorithm
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

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:7403440b82c4 · see in the full table