Some LCPs solvable in strongly polynomial time with Lemke's algorithm.
In: Mathematical Programming, Jg. 160 (2016-11-01), Heft 1/2, S. 477-493
Online
academicJournal
Zugriff:
Titel: |
Some LCPs solvable in strongly polynomial time with Lemke's algorithm.
|
---|---|
Autor/in / Beteiligte Person: | Adler, Ilan ; Cottle, Richard ; Pang, Jong-Shi |
Link: | |
Zeitschrift: | Mathematical Programming, Jg. 160 (2016-11-01), Heft 1/2, S. 477-493 |
Veröffentlichung: | 2016 |
Medientyp: | academicJournal |
ISSN: | 0025-5610 (print) |
DOI: | 10.1007/s10107-016-0996-4 |
Sonstiges: |
|