{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T12:01:46Z","timestamp":1757592106959},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1986,11]]},"DOI":"10.1007\/bf01840457","type":"journal-article","created":{"date-parts":[[2005,7,13]],"date-time":"2005-07-13T21:29:13Z","timestamp":1121290153000},"page":"455-482","source":"Crossref","is-referenced-by-count":61,"title":["A multiplicative barrier function method for linear programming"],"prefix":"10.1007","volume":"1","author":[{"given":"Masao","family":"Iri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01840457_CR1","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BFb0121192","volume":"8","author":"D. Avis","year":"1978","unstructured":"D. Avis and V. Chv\u00e1tal, Note on Bland's pivoting rule,Math. Programming Stud.,8 (1978), 24\u201334.","journal-title":"Math. Programming Stud."},{"key":"BF01840457_CR2","volume-title":"Another \u201csimple and fast\u201d algorithm for linear programming","author":"M. Iri","year":"1985","unstructured":"M. Iri, Another \u201csimple and fast\u201d algorithm for linear programming, paper presented at the 12th International Symposium on Mathematical Programming, August 5\u20139, 1985, MIT, Boston."},{"key":"BF01840457_CR3","unstructured":"M. Iri and H. Imai, A method of solving linear programming \u2014 with reference to the Karmarkar method and the penalty function method, Research Meeting of the Mathematical Programming Research Group of the Operations Research Society of Japan, February 16, 1985."},{"key":"BF01840457_CR4","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, A new polynomial-time algorithm for linear programming,Combinatorica,4 (1984), 373\u2013395.","journal-title":"Combinatorica"},{"key":"BF01840457_CR5","first-page":"1093","volume":"244","author":"L. G. Khachian","year":"1979","unstructured":"L. G. Khachian, A polynomial algorithm in linear programming,Dokl. Akad. Nauk SSSR,244 (1979), 1093\u20131096 (in Russian); transl. inSoviet Math. Dokl.,20 (1979), 191\u2013194.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"BF01840457_CR6","first-page":"51","volume":"20","author":"L. G. Khachian","year":"1980","unstructured":"L. G. Khachian, Polynomial algorithms in linear programming,Zh. Vychisl. Mat. i Mat. Fiz.,20 (1980), 51\u201368 (in Russian); transl. inU.S.S.R. Comput. Math. and Math. Phys.,20 (1980), 53\u201372.","journal-title":"Zh. Vychisl. Mat. i Mat. Fiz."},{"key":"BF01840457_CR7","first-page":"159","volume-title":"Inequalities III","author":"V. Klee","year":"1972","unstructured":"V. Klee and G. J. Minty, How good is the simplex algorithm?, inInequalities III (O. Shisha, ed.), Academic Press, New York, 1972, pp. 159\u2013175."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840457.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840457\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T19:35:32Z","timestamp":1557430532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":7,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["BF01840457"],"URL":"https:\/\/doi.org\/10.1007\/bf01840457","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}