A composite algorithm for a concave-cost network flow problem (Q3827773): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:55, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A composite algorithm for a concave-cost network flow problem |
scientific article |
Statements
A composite algorithm for a concave-cost network flow problem (English)
0 references
1989
0 references
routing multiple commodities
0 references
origin-destination pairs
0 references
minimum total cost
0 references
Economies of scale in arc flow costs
0 references
transportation planning
0 references
design of communication networks
0 references
plant location
0 references
capacity expansion
0 references
lower bounds
0 references
heuristic
0 references
computational results
0 references
