A strongly polynomial algorithm for generalized flow maximization (Q2976148)
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 strongly polynomial algorithm for generalized flow maximization |
scientific article; zbMATH DE number 6705640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strongly polynomial algorithm for generalized flow maximization |
scientific article; zbMATH DE number 6705640 |
Statements
A Strongly Polynomial Algorithm for Generalized Flow Maximization (English)
0 references
13 April 2017
0 references
network flow algorithms
0 references
generalized flows
0 references
strongly polynomial algorithms
0 references
linear programming
0 references
0 references
0 references
0 references
0.9806960821151732
0 references
0.9094908833503724
0 references
0.905264377593994
0 references
0.8337675929069519
0 references
