Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:59, 5 March 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