An \(O(nm^ 2)\) time algorithm for solving minimal cost network flow problems (Q3626409)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(nm^ 2) time algorithm for solving minimal cost network flow problems |
scientific article; zbMATH DE number 5556482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(nm^ 2)\) time algorithm for solving minimal cost network flow problems |
scientific article; zbMATH DE number 5556482 |
Statements
22 May 2009
0 references
network flow
0 references
node potentials
0 references
complementary slcackness conditions
0 references
0.8387933373451233
0 references
0.8379457592964172
0 references
0.8342523574829102
0 references
