Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509)
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: Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in O(N N) time |
scientific article; zbMATH DE number 5828288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time |
scientific article; zbMATH DE number 5828288 |
Statements
Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (English)
0 references
20 December 2010
0 references
inventory
0 references
dynamic programming
0 references
stochastic programming
0 references
algorithm complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
