{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T14:19:39Z","timestamp":1693318779060},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1974,12,1]],"date-time":"1974-12-01T00:00:00Z","timestamp":155088000000},"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":[[1974,12]]},"DOI":"10.1007\/bf01580244","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:58:43Z","timestamp":1114682323000},"page":"243-263","source":"Crossref","is-referenced-by-count":18,"title":["A generalized complementary pivoting algorithm"],"prefix":"10.1007","volume":"6","author":[{"given":"Michael J.","family":"Todd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Abstract polytopes","author":"I. Adler","year":"1971","unstructured":"I. Adler, \u201cAbstract polytopes\u201d, Ph.D. Thesis, Department of Operations Research, Stanford University, Stanford, Calif. (1971)."},{"key":"CR2","volume-title":"\u201cThe Euler characteristic of abstract polytopes\u201d, Tech. Rept. No. 71-11","author":"I. Adler","year":"1971","unstructured":"I. Adler, \u201cThe Euler characteristic of abstract polytopes\u201d, Tech. Rept. No. 71-11, Department of Operations Research, Stanford University, Stanford, Calif. (August 1971)."},{"key":"CR3","volume-title":"\u201cMaximum diameter of abstract polytopes\u201d, Tech. Rept. No. 71-12","author":"I. Adler","year":"1971","unstructured":"I. Adler and G.B. Dantzig, \u201cMaximum diameter of abstract polytopes\u201d, Tech. Rept. No. 71-12. Department of Operations Research, Stanford University, Stanford, Calif. (August 1971)."},{"key":"CR4","volume-title":"Introduction to the theory of graphs","author":"M. Bhezad","year":"1971","unstructured":"M. Bhezad and G. Chartrand,Introduction to the theory of graphs (Allyn and Bacon, Rockleigh, N.J., 1971)."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"R.W. Cottle and G.B. Dantzig, \u201cA generalization of the linear complementarity problem\u201d,Journal of Combinatorial Theory 8 (1) (1970).","DOI":"10.1016\/S0021-9800(70)80010-2"},{"key":"CR6","volume-title":"Nonlinear programming","author":"G.B. Dantzig","year":"1967","unstructured":"G.B. Dantzig and R.W. Cottle, \u201cPositive (semi-) definite programming\u201d, in:Nonlinear programming Ed. J. Abadie (North-Holland, Amsterdam, 1967)."},{"key":"CR7","volume-title":"\u201cThe linear complementarity problem in mathematical programming\u201d, Tech. Rept. No. 69-4","author":"B.C. Eaves","year":"1969","unstructured":"B.C. Eaves, \u201cThe linear complementarity problem in mathematical programming\u201d, Tech. Rept. No. 69-4, Department of Operations Research, Stanford University, Stanford, Calif. (July 1969)."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"B.C. Eaves, \u201cComputing Kakutani fixed points\u201d,Journal of the Society for Industrial and Applied Mathematics 21 (2) (1971).","DOI":"10.1137\/0121027"},{"issue":"2","key":"CR9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01584991","volume":"3","author":"B.C. Eaves","year":"1972","unstructured":"B.C. Eaves and R. Saigal, \u201cHomotopies for computation of fixed points on unbounded regions\u201d,Mathematical Programming 3 (2) (1972) 225\u2013237.","journal-title":"Mathematical Programming"},{"key":"CR10","series-title":"Cowles Foundation Discussion Paper","volume-title":"On the applications of a recent combinatorial algorithm","author":"T. Hansen","year":"1969","unstructured":"T. Hansen and H. Scarf, \u201cOn the applications of a recent combinatorial algorithm\u201d, Cowles Foundation Discussion Paper No. 272, Yale University, New Haven, Conn. (1969)."},{"key":"CR11","volume-title":"Computing methods in optimization problems 2","author":"H.W. Kuhn","year":"1969","unstructured":"H.W. Kuhn, \u201cApproximate search for fixed points\u201d, in:Computing methods in optimization problems 2 (Academic Press, New York, 1969)."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"C.E. Lemke, \u201cBimatrix equilibrium points and mathematical programming\u201d,Management Science 11 (7) (1965).","DOI":"10.1287\/mnsc.11.7.681"},{"key":"CR13","volume-title":"Mathematics of the decision sciences, Part I","author":"C.E. Lemke","year":"1968","unstructured":"C.E. Lemke, \u201cOn complementary pivot theory\u201d, in:Mathematics of the decision sciences, Part I, Eds. G.B. Dantzig and A.F. Veinott, Jr. (A.M.S., Providence, R.I., 1968)."},{"key":"CR14","volume-title":"Nonlinear programming","author":"C.E. Lemke","year":"1970","unstructured":"C.E. Lemke, \u201cRecent results on complementarity problems\u201d, in:Nonlinear programming (Academic Press, New York, 1970)."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"C.E. Lemke and J.T. Howson, Jr., \u201cEquilibrium points of bimatrix games\u201d,Journal of the Society for Industrial and Applied Mathematics 12 (2) (1964).","DOI":"10.1137\/0112033"},{"key":"CR16","volume-title":"Applications and extensions of an algorithm that computes fixed points of certain upper semi-continuous point to set mappings","author":"O.H. Merrill","year":"1972","unstructured":"O.H. Merrill, \u201cApplications and extensions of an algorithm that computes fixed points of certain upper semi-continuous point to set mappings\u201d, Ph.D. Dissertation, The University of Michigan, Ann. Arbor, Mich. (1972)."},{"key":"CR17","unstructured":"H. Scarf,The computation of economic equilibria (Yale University Press, New Haven, Conn.), to appear."},{"key":"CR18","volume-title":"\u201cAbstract complementary pivot theory\u201d, Tech. Rept. No. 61","author":"M.J. Todd","year":"1972","unstructured":"M.J. Todd, \u201cAbstract complementary pivot theory\u201d, Tech. Rept. No. 61, Dept. of Administrative Sciences, Yale University, New Haven, Conn. (October 1972)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580244.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580244\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:57:25Z","timestamp":1586231845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,12]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,12]]}},"alternative-id":["BF01580244"],"URL":"https:\/\/doi.org\/10.1007\/bf01580244","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,12]]}}}