Dynamic Programming is Optimal for Nonserial Optimization Problems (Q3937164): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0211004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2076776753 / rank | |||
Normal rank | |||
Latest revision as of 19:40, 19 March 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
