Dynamic Programming is Optimal for Nonserial Optimization Problems (Q3937164)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic Programming is Optimal for Nonserial Optimization Problems |
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
