A new strongly polynomial dual network simplex algorithm (Q1373742)
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 strongly polynomial dual network simplex algorithm |
scientific article; zbMATH DE number 1091305
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new strongly polynomial dual network simplex algorithm |
scientific article; zbMATH DE number 1091305 |
Statements
A new strongly polynomial dual network simplex algorithm (English)
0 references
25 November 1997
0 references
dual network simplex algorithm
0 references
minimum cost network flow
0 references
0.9523256
0 references
0.90856934
0 references
0 references
0.9049598
0 references
0.8878393
0 references
0.8794166
0 references
0.8781162
0 references
