{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:34:29Z","timestamp":1742913269555,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_338","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:00:04Z","timestamp":1219662004000},"page":"1889-1891","source":"Crossref","is-referenced-by-count":0,"title":["Linear Programming: Karmarkar Projective Algorithm"],"prefix":"10.1007","author":[{"given":"Kurt M.","family":"Anstreicher","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"338_CR1_338","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/BF01840458","volume":"1","author":"K.M. Anstreicher","year":"1986","unstructured":"Anstreicher KM (1986) A\u00a0monotonic projective algorithm for fractional linear programming. Algorithmica 1:483\u2013498","journal-title":"Algorithmica"},{"key":"338_CR2_338","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-1-4613-3449-1_4","volume-title":"Interior point methods of mathematical programming","author":"K.M. Anstreicher","year":"1996","unstructured":"Anstreicher KM (1996) Potential reduction algorithms. In: Terlaky T (ed) Interior point methods of mathematical programming. Kluwer, Dordrecht, pp 125\u2013158"},{"key":"338_CR3_338","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BF01840456","volume":"1","author":"G. de Ghellinck","year":"1986","unstructured":"de Ghellinck G, Vial J-Ph (1986) A\u00a0polynomial Newton method for linear programming. Algorithmica 1:425\u2013453","journal-title":"Algorithmica"},{"key":"338_CR4_338","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02591685","volume":"37","author":"D.M. Gay","year":"1987","unstructured":"Gay DM (1987) A\u00a0variant of Karmarkar's linear programming algorithm for problems in standard form. Math Program 37:81\u201390","journal-title":"Math. Program."},{"key":"338_CR5_338","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01582287","volume":"43","author":"C.C. Gonzaga","year":"1989","unstructured":"Gonzaga CC (1989) Conical projection algorithms for linear programming. Math Program 43:151\u2013173","journal-title":"Math. Program."},{"key":"338_CR6_338","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar N (1984) A\u00a0new polynomial-time algorithm for linear programming. Combinatorica 4:373\u2013395","journal-title":"Combinatorica"},{"key":"338_CR7_338","first-page":"3","volume":"76","author":"M.J. Todd","year":"1997","unstructured":"Todd MJ (1997) Potential-reduction methods in mathematical programming. Math Program 76:3\u201345","journal-title":"Math. Program."},{"key":"338_CR8_338","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y. Ye","year":"1991","unstructured":"Ye Y (1991) An O(n3L) potential reduction algorithm for linear programming. Math Program 50:239\u2013258","journal-title":"Math. Program."},{"key":"338_CR9_338","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF02592079","volume":"39","author":"Y. Ye","year":"1987","unstructured":"Ye Y, Kojima M (1987) Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming. Math Program 39:305\u2013317","journal-title":"Math. Program."}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T12:10:51Z","timestamp":1720699851000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_338"}},"subtitle":["Karmarkar Algorithm"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_338","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}