{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:26:54Z","timestamp":1649147214427},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993,1]]},"DOI":"10.1007\/bf01185339","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T11:45:05Z","timestamp":1108727105000},"page":"64-83","source":"Crossref","is-referenced-by-count":4,"title":["On combined phase 1-phase 2 projective methods for linear programming"],"prefix":"10.1007","volume":"9","author":[{"given":"Michael J.","family":"Todd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1989","unstructured":"I. Adler, N. Karmarkar, M. G. C. Resende, and G. Veiga, An implementation of Karmarkar's algorithm for linear programming,Mathematical Programming 44 (1989), 297?335.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/BF01840458","volume":"1","author":"K. M. Anstreicher","year":"1986","unstructured":"K. M. Anstreicher, A monotonie projective algorithm for fractional linear programming,Algorithmica 1 (1986), 483?498.","journal-title":"Algorithmica"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582290","volume":"43","author":"K. M. Anstreicher","year":"1989","unstructured":"K. M. Anstreicher, A combined phase I-phase II projective algorithm for linear programming,Mathematical Programming 43 (1989), 209?223.","journal-title":"Mathematical Programming"},{"key":"CR4","volume-title":"Discussion Paper 9030, CORE","author":"K. M. Anstreicher","year":"1990","unstructured":"K. M. Anstreicher and P. Watteyne, A family of search directions for Karmarkar's algorithm, Discussion Paper 9030, CORE, Catholic University of Louvain, Louvain-la-Neuve, 1990."},{"key":"CR5","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, Linear updates for a single-phase projective method,Operations Research Letters 9 (1990), 169?174.","journal-title":"Operations Research Letters"},{"key":"CR6","series-title":"Lecture Notes in Mathematics, Vol. 1405","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BFb0083584","volume-title":"Optimization","author":"C. Fraley","year":"1989","unstructured":"C. Fraley and J.-P. Vial, Numerical study of projective methods for linear programming, in:Optimization, S. Dolecki, ed., Lecture Notes in Mathematics, Vol. 1405, Springer-Verlag, Berlin, 1989, pp. 25?38."},{"key":"CR7","unstructured":"C. Fraley and J.-P. Vial, Single-phase versus multiphase projective methods for linear programming, Manuscript, COMIN, University of Geneva, May 1989."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF01582900","volume":"52","author":"R. Freund","year":"1991","unstructured":"R. Freund, A potential-function reduction algorithm for solving a linear program directly from an infeasible ?warm start?,Mathematical Programming 52 (1991), 441?466.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02591685","volume":"37","author":"D. Gay","year":"1987","unstructured":"D. Gay, A variant of Karmarkar's linear programming algorithm for problems in standard form,Mathematical Programming 37 (1987), 81?90.","journal-title":"Mathematical Programming"},{"key":"CR10","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.-P. Vial, A polynomial Newton method for linear programming.Algorithmica 1 (1986), 425?453.","journal-title":"Algorithmica"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02592072","volume":"39","author":"G. Ghellinck de","year":"1987","unstructured":"G. de Ghellinck and J.-P. Vial, An extension of Karmarkar's algorithm for solving a system of linear homogenous equations on the simplex,Mathematical Programming 39 (1987), 79?92.","journal-title":"Mathematical Programming"},{"key":"CR12","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, On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,Mathematical Programming 36 (1986), 183?209.","journal-title":"Mathematical Programming"},{"key":"CR13","unstructured":"P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Shifted barrier methods for linear programming, Technical Report SOL 88-9, Department of Operations Research, Stanford University, July 1988."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01759039","volume":"6","author":"C. Gonzaga","year":"1991","unstructured":"C. Gonzaga, Search directions for interior linear programming methods,Algorithmica 6 (1991), 153?181.","journal-title":"Algorithmica"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01582287","volume":"43","author":"C. Gonzaga","year":"1989","unstructured":"C. Gonzaga, Conical projection algorithms for linear programming,Mathematical Programming 43 (1989), 151?173.","journal-title":"Mathematical Programming"},{"key":"CR16","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?395.","journal-title":"Combinatorica"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno, and A. Yoshise, A polynomial-time algorithm for a class of linear complementarity problems,Mathematical Programming 44 (1989), 1?26.","journal-title":"Mathematical Programming"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"I. Lustig","year":"1990\/1991","unstructured":"I. Lustig, Feasibility issues in an interior-point method for linear programming,Mathematical Programming 49 (1990\/1991), 145?162.","journal-title":"Mathematical Programming"},{"key":"CR19","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, Computational experience with a primal-dual interior-point method for linear programming,Linear Algebra and Its Applications 152 (1991), 191?222.","journal-title":"Linear Algebra and Its Applications"},{"key":"CR20","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, An implementation of a primal-dual interiorpoint method for linear programming,ORSA Journal on Computing 1 (1989), 70?83.","journal-title":"ORSA Journal on Computing"},{"key":"CR21","volume-title":"M.Sc. Thesis","author":"A. Steger","year":"1985","unstructured":"A. Steger, An extension of Karmarkar's algorithm for bounded linear programming problems, M.Sc. Thesis, SUNY at Stonybrook, NY, 1985."},{"key":"CR22","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, An extension of Karmarkar's algorithm for linear programming using dual variables,Algorithmica 1 (1986), 409?424.","journal-title":"Algorithmica"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1287\/moor.13.4.650","volume":"13","author":"M. J. Todd","year":"1988","unstructured":"M. J. Todd, Improved bounds and containing ellipsoids in Karmarkar's linear programming algorithm,Mathematics of Operations Research 13 (1988), 650?659.","journal-title":"Mathematics of Operations Research"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"M. J. Todd, On Anstreicher's combined phase I-phase II projective algorithm for linear programming,Mathematical Programming, to appear.","DOI":"10.1007\/BF01581187"},{"key":"CR25","first-page":"81","volume-title":"Large-Scale Numerical Optimization","author":"M. J. Todd","year":"1990","unstructured":"M. J. Todd, The effects of degeneracy and null and unbounded variables on variants of Karmarkar's linear programming algorithm, in:Large-Scale Numerical Optimization, T. F. Coleman and Y. Li, eds., SIAM, Philadelphia, PA, 1990, pp. 81?91."},{"key":"CR26","series-title":"Lecture Notes in Mathematics, Vol. 1425","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BFb0083596","volume-title":"Optimization","author":"J.-P. Vial","year":"1989","unstructured":"J.-P. Vial, A unified approach to projective algorithms for linear programming, in:Optimization, S. Dolecki, ed., Lecture Notes in Mathematics, Vol. 1425, Springer-Verlag. Berlin, 1989, pp. 191?220."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02592079","volume":"39","author":"Y. Ye","year":"1987","unstructured":"Y. Ye and M. Kojima, Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming,Mathematical Programming 39 (1987), 305?317.","journal-title":"Mathematical Programming"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185339.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01185339\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:41:34Z","timestamp":1556714494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01185339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["BF01185339"],"URL":"https:\/\/doi.org\/10.1007\/bf01185339","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}