A perfect information lower bound for robust lot-sizing problems (Q1730584)
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: A perfect information lower bound for robust lot-sizing problems |
scientific article; zbMATH DE number 7032620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A perfect information lower bound for robust lot-sizing problems |
scientific article; zbMATH DE number 7032620 |
Statements
A perfect information lower bound for robust lot-sizing problems (English)
0 references
6 March 2019
0 references
multi-stage robust optimization
0 references
perfect information
0 references
lot-sizing problem
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0.86330754
0 references
0.86031127
0 references
0 references
0.84318906
0 references
0.84075046
0 references
0.8340478
0 references
0.8308086
0 references
0.8301735
0 references
0 references
