A new algorithm for solving the feasibility problem of a network flow (Q990544)
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: A new algorithm for solving the feasibility problem of a network flow |
scientific article; zbMATH DE number 5777026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for solving the feasibility problem of a network flow |
scientific article; zbMATH DE number 5777026 |
Statements
A new algorithm for solving the feasibility problem of a network flow (English)
0 references
1 September 2010
0 references
operation research
0 references
network flow
0 references
infeasible network
0 references
scaling algorithm
0 references
positive cut
0 references
0 references
0.8480405211448669
0 references
0.7807359099388123
0 references
0.7605326175689697
0 references
0.7605326175689697
0 references
0.7506899833679199
0 references
