{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T11:31:05Z","timestamp":1680435065797},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":[[1992,4]]},"DOI":"10.1007\/bf01581187","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:55:11Z","timestamp":1114667711000},"page":"1-15","source":"Crossref","is-referenced-by-count":12,"title":["On Anstreicher's combined phase I\u2014phase II projective algorithm for linear programming"],"prefix":"10.1007","volume":"55","author":[{"given":"Michael J.","family":"Todd","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 fractional linear programming,\u201dAlgorithmica 1 (1986) 483\u2013498.","journal-title":"Algorithmica"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582290","volume":"43","author":"K.M. Anstreicher","year":"1989","unstructured":"K.M. Anstreicher, \u201cA combined phase I\u2014phase II projective algorithm for linear programming,\u201dMathematical Programming 43 (1989) 209\u2013223.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01840456","volume":"1","author":"G. Ghellinck de","year":"1986","unstructured":"G. de Ghellinck and J.-Ph. Vial, \u201cA polynomial Newton method for linear programming,\u201dAlgorithmica 1 (1986) 425\u2013453.","journal-title":"Algorithmica"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","volume":"13","author":"M.E. Dyer","year":"1984","unstructured":"M.E. Dyer, \u201cLinear time algorithms for two- and three-variable linear programs,\u201dSIAM Journal on Computing 13 (1984) 31\u201345.","journal-title":"SIAM Journal on Computing"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02591685","volume":"37","author":"D. Gay","year":"1987","unstructured":"D. Gay, \u201cA variant of Karmarkar's linear programming algorithm for problems in standard form,\u201dMathematical Programming 37 (1987) 81\u201390.","journal-title":"Mathematical Programming"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01582287","volume":"43","author":"C. Gonzaga","year":"1989","unstructured":"C. Gonzaga, \u201cConical projection algorithms for linear programming,\u201dMathematical Programming 43 (1989) 151\u2013173.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01759039","volume":"6","author":"C. Gonzaga","year":"1991","unstructured":"C. Gonzaga, \u201cSearch directions for interior linear programming methods,\u201dAlgorithmica 6 (1991) 153\u2013181.","journal-title":"Algorithmica"},{"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 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, \u201cLinear-time algorithms for linear programming in \u211d3 and related problems,\u201dSIAM Journal on Computing 12 (1983) 759\u2013776.","journal-title":"SIAM Journal on Computing"},{"key":"CR10","first-page":"237","volume-title":"Contributions to Operations Research and Economics","author":"J.E. Mitchell","year":"1989","unstructured":"J.E. Mitchell and M.J. Todd, \u201cOn the relationship between the search directions in the affine and projective variants of Karmarkar's linear programming algorithm,\u201d in: B. Cornet and H. Tulkens, eds.,Contributions to Operations Research and Economics (MIT Press, Cambridge, MA, 1989) pp. 237\u2013250."},{"key":"CR11","volume-title":"An extension of Karmarkar's algorithm for bounded linear programming problems","author":"A. Steger","year":"1985","unstructured":"A. Steger, \u201cAn extension of Karmarkar's algorithm for bounded linear programming problems,\u201d M.S. Thesis, SUNY at Stonybrook (New York, 1985)."},{"key":"CR12","first-page":"81","volume-title":"Large-Scale Numerical Optimization","author":"M.J. Todd","year":"1990","unstructured":"M.J. Todd, \u201cThe effects of degeneracy and null and unbounded variables on variants of Karmarkar's linear programming algorithm,\u201d in: T.F. Coleman and Y. Li, eds.,Large-Scale Numerical Optimization (SIAM, Philadelphia, PA, 1990) pp. 81\u201391."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02592079","volume":"39","author":"Y. Ye","year":"1987","unstructured":"Y. Ye and M. Kojima, \u201cRecovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming,\u201dMathematical Programming 39 (1987) 305\u20133157.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581187.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581187\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581187","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:15Z","timestamp":1556881935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["BF01581187"],"URL":"https:\/\/doi.org\/10.1007\/bf01581187","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}