An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem (Q651729)
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(mn (nU)) time algorithm to solve the feasibility problem |
scientific article; zbMATH DE number 5989343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem |
scientific article; zbMATH DE number 5989343 |
Statements
An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem (English)
0 references
18 December 2011
0 references
network flows
0 references
the infeasibility problem
0 references
the infeasibility algorithm
0 references
0 references
0.8480405211448669
0 references
0.8170632123947144
0 references
0.7933182716369629
0 references
0.7722370028495789
0 references
