{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:42:00Z","timestamp":1648575720491},"reference-count":13,"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)90025-x","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"199-207","source":"Crossref","is-referenced-by-count":2,"title":["Todd's low-complexity algorithm is a predictor-corrector path-following method"],"prefix":"10.1016","volume":"11","author":[{"given":"M.J","family":"Todd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-P","family":"Vial","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90025-X_BIB1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01594923","article-title":"Limiting behaviour of the affine scaling continuous trajectories for linear programming problems","volume":"50","author":"Adler","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90025-X_BIB2","article-title":"Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming","author":"Anstreicher","year":"1990"},{"key":"10.1016\/0167-6377(92)90025-X_BIB3","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","article-title":"A variation on Karmarkar's algorithm for solving linear programming problems","volume":"36","author":"Barnes","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90025-X_BIB4","article-title":"A polynomial time version of the affine algorithm","author":"Barnes","year":"1988"},{"key":"10.1016\/0167-6377(92)90025-X_BIB5","first-page":"747","article-title":"Iterative solution of problems of linear and quadratic programming","volume":"174","author":"Dikin","year":"1967","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"10.1016\/0167-6377(92)90025-X_BIB6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","article-title":"On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method","volume":"36","author":"Gill","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90025-X_BIB7","article-title":"Short steps with Karmarkar's projective algorithm for linear programming","author":"Goffin","year":"1990"},{"key":"10.1016\/0167-6377(92)90025-X_BIB8","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)90025-X_BIB9","author":"Moler","year":"1987"},{"key":"10.1016\/0167-6377(92)90025-X_BIB10","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01586056","article-title":"A polynomial method of approximate centers for linear programming","volume":"54","author":"Roos","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90025-X_BIB11","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1137\/0802011","article-title":"A low complexity interior point algorithm for linear programming","volume":"2","author":"Todd","year":"1992","journal-title":"SIAM J. Optim."},{"key":"10.1016\/0167-6377(92)90025-X_BIB12","article-title":"A path-following projective interior point method for linear programming","author":"Xiao","year":"1990"},{"key":"10.1016\/0167-6377(92)90025-X_BIB13","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","article-title":"An O(n3L) potential reduction method 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:016763779290025X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290025X?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:10Z","timestamp":1552902610000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290025X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["016763779290025X"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90025-x","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}