{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:59:51Z","timestamp":1648990791090},"reference-count":6,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1991,10]]},"DOI":"10.1016\/0167-6377(91)90040-v","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"389-393","source":"Crossref","is-referenced-by-count":3,"title":["Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program"],"prefix":"10.1016","volume":"10","author":[{"given":"John A.","family":"Kaliski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(91)90040-V_BIB1","article-title":"On the performance of Karmarkar's algorithm over a sequence of iterations","author":"Anstreicher","year":"1989","journal-title":"Manuscript"},{"key":"10.1016\/0167-6377(91)90040-V_BIB2","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/moor.14.2.294","article-title":"A worst-case step in Karmarkar's algorithm","volume":"14","author":"Anstreicher","year":"1989","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(91)90040-V_BIB3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0167-6377(91)90040-V_BIB4","series-title":"Inequalities III","first-page":"159","article-title":"How good is the simplex method","author":"Klee","year":"1972"},{"issue":"3","key":"10.1016\/0167-6377(91)90040-V_BIB5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF01585747","article-title":"On the improvement per iteration in Karmarkar's algorithm for linear programming","volume":"46","author":"McDiarmid","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(91)90040-V_BIB6","article-title":"Complexity analysis on Karmarkar's algorithm","author":"Ye","year":"1990"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190040V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190040V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:27:18Z","timestamp":1552886838000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779190040V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":6,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["016763779190040V"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(91)90040-v","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}