Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost (Q1758285)
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: Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost |
scientific article; zbMATH DE number 6103797
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost |
scientific article; zbMATH DE number 6103797 |
Statements
Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost (English)
0 references
8 November 2012
0 references
single-item
0 references
capacitated lot sizing problem
0 references
stepwise costs
0 references
polynomial time algorithm
0 references
dynamic programming
0 references
0 references
0 references
0 references
0 references
0 references
