{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:18:10Z","timestamp":1648685890413},"reference-count":15,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":[[1992,5]]},"DOI":"10.1016\/0167-6377(92)90026-y","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"209-212","source":"Crossref","is-referenced-by-count":4,"title":["On interior algorithms for linear programming with no regularity assumptions"],"prefix":"10.1016","volume":"11","author":[{"given":"Kurt M","family":"Anstreicher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90026-Y_BIB1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582290","article-title":"A combined phase I-phase II projective algorithm for linear programming","volume":"43","author":"Anstreicher","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB2","article-title":"A combined phase I-phase II scaled potential algorithm for linear programming","author":"Anstreicher","year":"1990"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01840456","article-title":"A polynomial Newton method for linear programming","volume":"1","author":"de Ghellinck","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01580737","article-title":"A relaxed version of Karmarkar's algorithm","volume":"40","author":"Goldfarb","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB5","article-title":"Path-following methods for linear programming","author":"Gonzaga","year":"1991","journal-title":"SIAM Review"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB6","article-title":"Convergence behavior of some interior-point algorithms","author":"G\u00fcler","year":"1991"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB7","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(92)90026-Y_BIB8","series-title":"Theory of linear and integer programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB9","article-title":"Review of Karmarkar (1984)","author":"Todd","year":"1986","journal-title":"Computing Reviews"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB10","article-title":"Recent developments and new directions in linear programming","author":"Todd","year":"1988"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB11","article-title":"On Anstreicher's combined phase I-phase II projective algorithm for linear programming","author":"Todd","year":"1989"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB12","article-title":"The effect of sparsity, degeneracy, and null and unbounded variables on variants of Karmarkar's linear programming algorithm","author":"Todd","year":"1989"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB13","article-title":"On combined phase I-phase II projective methods for linear programming","author":"Todd","year":"1989"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB14","article-title":"Combining phase I and phase II in a potential reduction algorithm for linear programming","author":"Todd","year":"1990"},{"key":"10.1016\/0167-6377(92)90026-Y_BIB15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","article-title":"An O(n3L) potential reduction algorithm for linear programming","volume":"50","author":"Ye","year":"1991","journal-title":"Math. Programming"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290026Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290026Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:50:09Z","timestamp":1552902609000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290026Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["016763779290026Y"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90026-y","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}