An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs (Q1888151)
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(T T) algorithm for the dynamic lot size problem with limited storage and linear costs |
scientific article; zbMATH DE number 2117680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs |
scientific article; zbMATH DE number 2117680 |
Statements
An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs (English)
0 references
22 November 2004
0 references
Inventory dynamic systems
0 references
lot size
0 references
capacity constraint
0 references
0.8856773376464844
0 references
0.8808876872062683
0 references
0.8741777539253235
0 references
0.8616517186164856
0 references
