{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T11:27:40Z","timestamp":1680434860929},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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":[[1993,3]]},"DOI":"10.1007\/bf01581241","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:46:38Z","timestamp":1114667198000},"page":"133-150","source":"Crossref","is-referenced-by-count":7,"title":["Combining phase I and phase II in a potential reduction algorithm for linear programming"],"prefix":"10.1007","volume":"59","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","series-title":"CORE Discussion Paper","volume-title":"A combined phase I\u2014phase II scaled potential algorithm for linear programming","author":"K.M. Anstreicher","year":"1989","unstructured":"K.M. Anstreicher, \u201cA combined phase I\u2014phase II scaled potential algorithm for linear programming,\u201d CORE Discussion Paper 8939, CORE Catholic University of Louvain, Belgium, 1989."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0024-3795(91)90276-3","volume":"152","author":"K.M. Anstreicher","year":"1991","unstructured":"K.M. Anstreicher, \u201cOn monotonicity in the scaled potential algorithm for linear programming,\u201dLinear Algebra and its Applications 152 (1991) 223\u2013232.","journal-title":"Linear Algebra and its Applications"},{"key":"CR5","series-title":"CORE Discussion Paper","volume-title":"A family of search directions for Karmarker's algorithm","author":"K.M. Anstreicher","year":"1990","unstructured":"K.M. Anstreicher and P. Watteyne, \u201cA family of search directions for Karmarker's algorithm,\u201d CORE Discussion Paper 9030, CORE Catholic University of Louvain, Belgium, 1990."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0167-6377(90)90015-W","volume":"9","author":"C. Fraley","year":"1990","unstructured":"C. Fraley, \u201cLinear updates for a single-phase projective method,\u201dOperations Research Letters 9 (1990) 169\u2013174.","journal-title":"Operations Research Letters"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01586933","volume":"51","author":"R.M. Freund","year":"1991","unstructured":"R.M. Freund, \u201cPolynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function,\u201dMathematical Programming 51 (1991) 203\u2013222.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0024-3795(91)90265-X","volume":"152","author":"R.M. Freund","year":"1991","unstructured":"R.M. Freund, \u201cTheoretical efficiency of a shifted barrier function algorithm for linear programming,\u201dLinear Algebra and its Aplications 152 (1991) 19\u201341.","journal-title":"Linear Algebra and its Aplications"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF01582900","volume":"52","author":"R.M. Freund","year":"1991","unstructured":"R.M. Freund, \u201cA potential-function reduction algorithm for solving a linear program directly from an infeasible \u2018warm start\u2019,\u201dMathematical Programming (Series B) 52 (1991) 441\u2013466.","journal-title":"Mathematical Programming (Series B)"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02591685","volume":"37","author":"G. Ghellinck de","year":"1987","unstructured":"G. de Ghellinck and J.-P. Vial, \u201cAn extension of Karmarkar's algorithm for problems in standard form,\u201dMathematical Programming 37 (1987) 81\u201390.","journal-title":"Mathematical Programming"},{"key":"CR11","unstructured":"P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, \u201cShifted barrier methods for linear programming,\u201d Technical Report SOL 88-9, Department of Operations Research, Stanford University, 1988."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01588776","volume":"49","author":"C.C. Gonzaga","year":"1990","unstructured":"C.C. Gonzaga, \u201cPolynomial affine algorithms for linear programming,\u201dMathematical Programming 49 (1990) 7\u201321.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"44","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial time algorithm for linear programming,\u201dCombinatorica 44 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"I. Lustig","year":"1990\/91","unstructured":"I. Lustig, \u201cFeasibility issues in an interior point method for linear programming,\u201dMathematical Programming 49 (1990\/91) 145\u2013162.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I. Lustig","year":"1991","unstructured":"I. Lustig, R.E. Marsten and D.F. Shanno, \u201cComputational experience with a primal\u2014dual interiorpoint method for linear programming,\u201dLinear Algebra and its Applications 152 (1991) 191\u2013222.","journal-title":"Linear Algebra and its Applications"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/ijoc.1.2.70","volume":"1","author":"K.A. McShane","year":"1989","unstructured":"K.A. McShane, C.L. Monma, and D. Shanno, \u201cAn implementation of a primal\u2014dual interior point method for linear programming,\u201dORSA Journal on Computing 1 (1989), 70\u201383.","journal-title":"ORSA Journal on Computing"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01586050","volume":"54","author":"R.A. Polyak","year":"1992","unstructured":"R.A. Polyak, \u201cModified barrier functions (theory and methods),\u201dMathematical Programming 54 (1992) 177\u2013222.","journal-title":"Mathematical Programming"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01581187","volume":"55","author":"M.J. Todd","year":"1992","unstructured":"M.J. Todd, \u201cOn Anstreicher's combined phase I\u2014phase II projective algorithm for linear programming,\u201dMathematical Programming 55 (1992) 1\u201315.","journal-title":"Mathematical Programming"},{"key":"CR19","unstructured":"M.J. Todd and Y. Wang, \u201cOn combined phase 1\u2014phase 2 projective methods for linear programming,\u201d to appear inAlgorithmica."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y. Ye","year":"1991","unstructured":"Y. Ye, \u201cAn O(n 3 L) potential reduction algorithm for linear programming,\u201dMathematical Programming 50 (1991) 239\u2013258.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581241.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581241\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:16Z","timestamp":1556881936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01581241"],"URL":"https:\/\/doi.org\/10.1007\/bf01581241","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}