Construct · 1 fields · 1 citations

dynamic programming: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
dynamicprogramming1 CONSTRUCTDynamic programmingBELLMAN · ALGORITHMS AND DATA

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithms and data structures

a method that solves multistage decision problems by breaking them into overlapping subproblems and building optimal solutions from optimal solutions of the parts.

In algorithms and data structures, dynamic programming refers to a method that solves multistage decision problems by breaking them into overlapping subproblems and building optimal solutions from optimal solutions of the parts. This meaning comes from Bellman (1954) in Bulletin of the American Mathematical Society.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how dynamic programming sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

Bellman equation1 fields · 4 citationsanchor · a standalone constructbackward induction2 fields · 2 citationsinvariant · one construct, two systemscolor-coding1 fields · 1 citationsanchor · a standalone construct

References

  1. Bellman, R. (1954). The theory of dynamic programming. Bulletin of the American Mathematical Society, 60(6), 503-515. https://doi.org/10.1090/s0002-9904-1954-09848-8

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct