A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs (Q1926904)
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: A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs |
scientific article; zbMATH DE number 6119482
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs |
scientific article; zbMATH DE number 6119482 |
Statements
A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs (English)
0 references
29 December 2012
0 references
lot-sizing
0 references
polynomial time algorithm
0 references
minimum order quantity
0 references
capacity constraint
0 references
0 references
0 references
