Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934)
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: Strongly polynomial dual simplex methods for the maximum flow problem |
scientific article; zbMATH DE number 1127723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strongly polynomial dual simplex methods for the maximum flow problem |
scientific article; zbMATH DE number 1127723 |
Statements
Strongly polynomial dual simplex methods for the maximum flow problem (English)
0 references
11 March 1998
0 references
strongly polynomial
0 references
valid distance labels
0 references
dual network simplex algorithms
0 references
maximum flow problem
0 references
preflow
0 references
0 references
0 references
0.9525938034057616
0 references
0.8877121806144714
0 references
0.8840039968490601
0 references
