{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T06:05:56Z","timestamp":1760249156699},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1983,10,1]],"date-time":"1983-10-01T00:00:00Z","timestamp":433814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1983,10]]},"DOI":"10.1007\/bf02591869","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:38:47Z","timestamp":1175168327000},"page":"316-325","source":"Crossref","is-referenced-by-count":4,"title":["Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's"],"prefix":"10.1007","volume":"26","author":[{"given":"John R.","family":"Birge","sequence":"first","affiliation":[]},{"given":"Akli","family":"Gana","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02591869_CR1","first-page":"144","volume-title":"Mathematics of the decision sciences Part 1","author":"R.W. Cottle","year":"1968","unstructured":"R.W. Cottle \u201cThe principal pivoting method of quadratic programming\u201d, in: G.B. Dantzig and A.F. Veinott Jr., eds,Mathematics of the decision sciences Part 1 (American Mathematical Society, Providence, RI, 1968 pp. 144\u2013162."},{"key":"BF02591869_CR2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01581653","volume":"19","author":"R.W. Cottle","year":"1980","unstructured":"R.W. Cottle, \u201cCompletelyQ-matrices\u201d,Mathematical Programming 19 (1980) 347\u2013351.","journal-title":"Mathematical Programming"},{"key":"BF02591869_CR3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(68)90052-9","volume":"1","author":"R.W. Cottle","year":"1968","unstructured":"R.W. Cottle and G.B. Dantzig, \u201cComplementary pivot theory of mathematical programming\u201d,Linear Algebra and its Applications 1 (1968) 103\u2013125.","journal-title":"Linear Algebra and its Applications"},{"key":"BF02591869_CR4","volume-title":"On the computational complexity of the linear complementarity problem","author":"Y. Fathi","year":"1979","unstructured":"Y. Fathi, \u201cOn the computational complexity of the linear complementarity problem\u201d, Dissertation, The University of Michigan (Ann Arbor, MI, 1979)."},{"key":"BF02591869_CR5","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"4","author":"C.E. Lemke","year":"1965","unstructured":"C.E. Lemke, \u201cBimatrix equilibrium points and mathematical programming\u201d,Management Science 4 (1965) 681\u2013689.","journal-title":"Management Science"},{"key":"BF02591869_CR6","first-page":"123","volume":"11","author":"K.G. Murty","year":"1974","unstructured":"K.G. Murty, \u201cNote on a Bard-type scheme for solving the complementarity problem\u201d,Opsearch 11 (1974) 123\u2013130.","journal-title":"Opsearch"},{"key":"BF02591869_CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120782","volume":"7","author":"K.G. Murty","year":"1978","unstructured":"K.G. Murty, \u201cComputational complexity of complementary pivot methods\u201d,Mathematical Programming Study 7 (1978) 61\u201373.","journal-title":"Mathematical Programming Study"},{"key":"BF02591869_CR8","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/BF01585104","volume":"24","author":"M.J. Todd","year":"1982","unstructured":"M.J. Todd, \u201cOn computational complexity of piecewise-linear homotopy algorithms\u201d,Mathematical Programming 24 (1982) 216\u2013224.","journal-title":"Mathematical Programming"},{"key":"BF02591869_CR9","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/BF01581652","volume":"19","author":"L. Heyden Van der","year":"1980","unstructured":"L. Van der Heyden, \u201cA variable dimension algorithm for the linear complementarity problem\u201d,Mathematical Programming 19 (1980) 328\u2013346.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591869.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591869\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591869","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:50Z","timestamp":1558381070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,10]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,10]]}},"alternative-id":["BF02591869"],"URL":"https:\/\/doi.org\/10.1007\/bf02591869","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,10]]}}}