The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption (Q2829586)
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: The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption |
scientific article; zbMATH DE number 6648984
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption |
scientific article; zbMATH DE number 6648984 |
Statements
The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption (English)
0 references
8 November 2016
0 references
linear programming
0 references
simplex method
0 references
strongly polynomial algorithm
0 references
totally unimodular matrix
0 references
0.8534775
0 references
0.85146934
0 references
0.85146934
0 references
0.84126186
0 references
0 references
0.83771974
0 references
0.83097374
0 references
