{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T07:27:03Z","timestamp":1692430023738},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1007\/bf01585747","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:12:20Z","timestamp":1114679540000},"page":"299-320","source":"Crossref","is-referenced-by-count":7,"title":["On the improvement per iteration in Karmarkar's algorithm for linear programming"],"prefix":"10.1007","volume":"46","author":[{"given":"Colin","family":"Mcdiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/BF01840458","volume":"1","author":"K.M. Anstreicher","year":"1986","unstructured":"K.M. Anstreicher, \u201cA monotonic projective algorithm for linear programming,\u201dAlgorithmica 1 (1986) 483\u2013496.","journal-title":"Algorithmica"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"K.M. Anstreicher, \u201cThe worst-case step in Karmarkar's algorithm,\u201d to appear in:Mathematics of Operations Research (1989).","DOI":"10.1287\/moor.14.2.294"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"M.D. Asic, V.V. Kovacevic-Vujcic and M.D. Radosavljevic-Nikolic, \u201cAsymptotic behaviour of Karmarkar's method for linear programming,\u201dMathematical Programming 46 (1990).","DOI":"10.1007\/BF01585736"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF01840462","volume":"1","author":"C. Blair","year":"1986","unstructured":"C. Blair, \u201cThe iterative step in the linear programming algorithm of N. Karmarkar,\u201dAlgorithmica 1 (1986) 537\u2013539.","journal-title":"Algorithmica"},{"key":"CR5","unstructured":"M.E. Dyer, private communication (1985)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1057\/jors.1988.43","volume":"39","author":"M.C. Ferris","year":"1988","unstructured":"M.C. Ferris and A.B. Philpott, \u201cOn the performance of Karmarkar's algorithm,\u201dOperational Research Society Journal 39 (1988) 257\u2013270.","journal-title":"Operational Research Society Journal"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, \u201cOn projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,\u201dMathematical Programming 36 (1986) 183\u2013209.","journal-title":"Mathematical Programming"},{"issue":"4","key":"CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial-time algorithm for linear programming,\u201dCombinatorica 4(4) (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR9","volume-title":"On the improvement per iteration in Karmarkar's method for linear programming","author":"C.J.H. McDiarmid","year":"1986","unstructured":"C.J.H. McDiarmid, \u201cOn the improvement per iteration in Karmarkar's method for linear programming,\u201d Oxford University (Oxford, UK, 1986)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0167-6377(86)90025-8","volume":"4","author":"M. Padberg","year":"1986","unstructured":"M. Padberg, \u201cA different convergence proof for the projective method for linear programming,\u201dOperations Research Letters 4 (1986) 253\u2013257.","journal-title":"Operations Research Letters"},{"key":"CR11","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"A Schrijver,Theory of Linear and Integer Programming (Wiley, New York, 1986)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01840455","volume":"1","author":"M.J. Todd","year":"1986","unstructured":"M.J. Todd and B.P. Burrell, \u201cAn extension of Karmarkar's algorithm for linear programming using dual variables,\u201dAlgorithmica 1 (1986), 409\u2013424.","journal-title":"Algorithmica"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585747.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585747\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:31Z","timestamp":1556897551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["BF01585747"],"URL":"https:\/\/doi.org\/10.1007\/bf01585747","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}