Dynamic Programming is Optimal for Nonserial Optimization Problems (Q3937164): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:30, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic Programming is Optimal for Nonserial Optimization Problems |
scientific article |
Statements
Dynamic Programming is Optimal for Nonserial Optimization Problems (English)
0 references
1982
0 references
discrete optimization
0 references
limited form of decomposition
0 references
nonoverlapping comparison algorithms
0 references
Bellman's principle of optimality
0 references
nonserial dynamic programming
0 references
exponential lower bound
0 references
perfect elimination graph
0 references
