Strong polynomial-time solvability of a minimum concave cost network flow problem. (Q1582279): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:54, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strong polynomial-time solvability of a minimum concave cost network flow problem. |
scientific article |
Statements
Strong polynomial-time solvability of a minimum concave cost network flow problem. (English)
0 references
2000
0 references
