Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost (Q1758285): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:56, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost |
scientific article |
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
