Solving worrying simplex's instances in polynomial time (Q4982576)
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 6423939
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving worrying simplex's instances in polynomial time |
scientific article; zbMATH DE number 6423939 |
Statements
9 April 2015
0 references
linear programming (LP)
0 references
hyperplane
0 references
dichotomy
0 references
basic feasible solutions
0 references
Klee-Minty's linear programming
0 references
polynomial complexity
0 references
0.779022216796875
0 references
0.7504159808158875
0 references
