A minimum concave-cost dynamic network flow problem with an application to lot-sizing (Q3703618)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A minimum concave-cost dynamic network flow problem with an application to lot-sizing |
scientific article |
Statements
A minimum concave-cost dynamic network flow problem with an application to lot-sizing (English)
0 references
1985
0 references
minimum-cost dynamic network flow
0 references
special network
0 references
infinite-horizon, lot-sizing problem
0 references
deterministic demand
0 references
periodic data
0 references
long-run average-cost per period
0 references
discounted cost
0 references
polynomial algorithms
0 references
