The construction of discrete dynamic programming algorithms

  • Authors:

  • M. Held;R. M. Karp

  • Affiliations:

  • -;Thomas J. Watson Research Center, Yorktown Heights, New York

  • Venue:
  • IBM Systems Journal
  • Year:
  • 1965

Quantified Score

Hi-index 0.00

Visualization

Abstract

Certain sequencing and scheduling problems are formulated as shortest-route problems and treated in a uniform manner by dynamic programming. Computational considerations are discussed.