A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs (Q1926904): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:08, 1 February 2024
scientific article
| 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 |
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
