Name
Abstract | ||
|---|---|---|
In this paper, a robust inventory problem with uncertain cumulative demands is considered. Interval-budgeted uncertainty sets are used to model possible cumulative demand scenarios. It is shown that under discrete budgeted uncertainty the robust min-max problem can be solved in polynomial time. On the other hand, for continuous budgeted uncertainty, the problem is weakly NP-hard. It can be solved in pseudopolynomial time and admits an FPTAS for nonoverlapping cumulative demand intervals. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/s11590-022-01875-9 | OPTIMIZATION LETTERS |
Keywords | DocType | Volume |
Production planning, Demand uncertainty, Robust optimization | Journal | 16 |
Issue | ISSN | Citations |
9 | 1862-4472 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Romain Guillaume | 1 | 0 | 1.35 |
| Adam Kasperski | 2 | 0 | 0.34 |
| Paweł Zieliński | 3 | 274 | 19.73 |