An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs (Q943783)
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: An O(n^2) algorithm for lot sizing with inventory bounds and fixed costs |
scientific article; zbMATH DE number 5324076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs |
scientific article; zbMATH DE number 5324076 |
Statements
An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs (English)
0 references
10 September 2008
0 references
lot sizing
0 references
dynamic programming
0 references
extreme points
0 references
0 references
0 references
0.8682113885879517
0 references
0.8385710716247559
0 references
0.8376031517982483
0 references
0.8291642665863037
0 references
0.8270023465156555
0 references
