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 \log (nU))\) time algorithm to solve the feasibility problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem |
scientific article |
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
