{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T15:47:13Z","timestamp":1773676033176,"version":"3.50.1"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"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":[[1979,12]]},"DOI":"10.1007\/bf01582098","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:28:41Z","timestamp":1114676921000},"page":"127-130","source":"Crossref","is-referenced-by-count":20,"title":["Cycling in linear complementarity problems"],"prefix":"10.1007","volume":"16","author":[{"given":"Michael M.","family":"Kostreva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/nav.3800020406","volume":"2","author":"E.M.L. Beale","year":"1955","unstructured":"E.M.L. Beale, \u201cCycling in the dual simplex algorithm\u201d,Naval Research Logistics Quarterly 2 (1955) 269\u2013275.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR2","volume-title":"Linear programming and extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, 1963)."},{"key":"CR3","unstructured":"A.J. Hoffman, \u201cCycling in the simplex algorithm\u201d, National Bureau of Standards, Rept. No. 2974 (December 1953)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"C.E. Lemke","year":"1965","unstructured":"C.E. Lemke, \u201cBimatrix equilibrium points and mathematical programming\u201d,Management Science 11 (1965) 681\u2013689.","journal-title":"Management Science"},{"key":"CR5","first-page":"95","volume-title":"Mathematics of the Decision Sciences","author":"C.M. Lemke","year":"1968","unstructured":"C.M. Lemke, \u201cOn complementary pivot theory\u201d, in: G.B. Dantzig and A.F. Veinott, Jr., eds.,Mathematics of the Decision Sciences (Am. Math. Soc., Providence, RI, 1968) pp. 95\u2013114."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1145\/361573.1015087","volume":"15","author":"A. Ravindran","year":"1972","unstructured":"A. Ravindran, \u201cAlgorithm 431 [H]. A computer routine for quadratic and linear programming problems\u201d,Communications of the ACM 15 (1972) 818\u2013820.","journal-title":"Communications of the ACM"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582098.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582098\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T02:27:52Z","timestamp":1625884072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["BF01582098"],"URL":"https:\/\/doi.org\/10.1007\/bf01582098","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}