Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(93)90025-j / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2060088365 / rank | |||
Normal rank |
Latest revision as of 10:22, 30 July 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
0 references
0 references
0 references
0 references
0 references