An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem (Q2496059)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5037999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem |
scientific article; zbMATH DE number 5037999 |
Statements
An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem (English)
0 references
30 June 2006
0 references
capacitated lot-sizing
0 references
production
0 references
inventory
0 references
0 references
0 references
0 references
0.8696029782295227
0 references
0.8655017018318176
0 references
0.8648927807807922
0 references
0.8648672699928284
0 references
