Some LCPs solvable in strongly polynomial time with Lemke's algorithm (Q344960)
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: Some LCPs solvable in strongly polynomial time with Lemke's algorithm |
scientific article; zbMATH DE number 6656105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some LCPs solvable in strongly polynomial time with Lemke's algorithm |
scientific article; zbMATH DE number 6656105 |
Statements
Some LCPs solvable in strongly polynomial time with Lemke's algorithm (English)
0 references
25 November 2016
0 references
Lemke's algorithm
0 references
parametric principal pivoting method
0 references
covering vector
0 references
parametric direction vector
0 references
0.8183549642562866
0 references
0.8142695426940918
0 references
0.8114843368530273
0 references
0.8087376952171326
0 references
