A composite algorithm for a concave-cost network flow problem (Q3827773): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230190202 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002111665 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:43, 19 March 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
