{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:30:21Z","timestamp":1757626221591,"version":"3.44.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0167-6377(92)90023-v","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"59-64","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Strict monotonicity in Todd's low-complexity algorithm for linear programming"],"prefix":"10.1016","volume":"12","author":[{"given":"Shinji","family":"Mizuno","sequence":"first","affiliation":[]},{"given":"Atsushi","family":"Nagasawa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90023-V_BIB1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0024-3795(91)90276-3","article-title":"On monotonicity in the scaled potential algorithm for linear programming","volume":"152","author":"Anstreicher","year":"1991","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0167-6377(92)90023-V_BIB2","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"},{"article-title":"A polynomial time version of the affine algorithm","year":"1988","author":"Barnes","key":"10.1016\/0167-6377(92)90023-V_BIB3"},{"key":"10.1016\/0167-6377(92)90023-V_BIB4","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)90023-V_BIB5","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"},{"article-title":"A low complexity interior-point algorithm for linear programming","year":"1990","author":"Todd","key":"10.1016\/0167-6377(92)90023-V_BIB6"},{"article-title":"Todd's low-complexity algorithm is a predictor-corrector path-following method","year":"1990","author":"Todd","key":"10.1016\/0167-6377(92)90023-V_BIB7"},{"key":"10.1016\/0167-6377(92)90023-V_BIB8","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:016763779290023V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290023V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:20:26Z","timestamp":1757452826000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290023V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["016763779290023V"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90023-v","relation":{},"ISSN":["0167-6377"],"issn-type":[{"type":"print","value":"0167-6377"}],"subject":[],"published":{"date-parts":[[1992,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Strict monotonicity in Todd's low-complexity algorithm for linear programming","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-6377(92)90023-V","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}