Polyhedral Characterization of Discrete Dynamic Programming (Q3496158)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4170653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polyhedral Characterization of Discrete Dynamic Programming |
scientific article; zbMATH DE number 4170653 |
Statements
Polyhedral Characterization of Discrete Dynamic Programming (English)
0 references
1990
0 references
multiechelon lot sizing
0 references
recursive computations
0 references
polyhedral description
0 references
shortest path
0 references
acyclic graphs
0 references
directed hypergraph
0 references
hyperflow
0 references
0.7833028435707092
0 references
0.7690238952636719
0 references
0.7690238952636719
0 references
