A parametric algorithm for convex cost network flow and related problems (Q789313): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(84)90076-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052415705 / rank | |||
Normal rank | |||
Revision as of 01:26, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parametric algorithm for convex cost network flow and related problems |
scientific article |
Statements
A parametric algorithm for convex cost network flow and related problems (English)
0 references
1984
0 references
computational complexity
0 references
polynomial boundedness
0 references
computational results
0 references
context cost network flow problem
0 references
minimum cost flow
0 references
parametric algorithm
0 references
optimum basis structure
0 references
shortest paths
0 references
large size problems
0 references
project cost curve
0 references
CPM network
0 references
optimum capacity expansion
0 references
