Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:24, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strongly polynomial dual simplex methods for the maximum flow problem |
scientific article |
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
