Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:27, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two strongly polynomial cut cancelling algorithms for minimum cost network flow |
scientific article |
Statements
Two strongly polynomial cut cancelling algorithms for minimum cost network flow (English)
0 references
2 January 1994
0 references
strongly polynomial algorithms
0 references
minimum cost network flow
0 references
