Polynomial dual network simplex algorithms (Q689130)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 440078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial dual network simplex algorithms |
scientific article; zbMATH DE number 440078 |
Statements
Polynomial dual network simplex algorithms (English)
0 references
6 December 1993
0 references
minimum cost network flows
0 references
strongly polynomial capacity scaling algorithms
0 references
transshipment problem
0 references
polynomial dual network simplex pivot rule
0 references
0 references
0 references
0.8409767746925354
0 references
0.8389204740524292
0 references
0.8349476456642151
0 references
0.8281010389328003
0 references
0.8258970379829407
0 references
