"Some LCPs solvable in strongly polynomial time with Lemke's algorithm."

Ilan Adler, Richard W. Cottle, Jong-Shi Pang (2016)

> Home

Details and statistics

DOI: 10.1007/S10107-016-0996-4

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/AdlerCP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/AdlerCP16
Ilan Adler, Richard W. Cottle, Jong-Shi Pang:
Some LCPs solvable in strongly polynomial time with Lemke's algorithm. Math. Program. 160(1-2): 477-493 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.