{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T12:17:01Z","timestamp":1680437821340},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1007\/bf02032308","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T14:16:36Z","timestamp":1123683396000},"page":"19-38","source":"Crossref","is-referenced-by-count":1,"title":["Experimental investigations in combining primal dual interior point method and simplex based LP solvers"],"prefix":"10.1007","volume":"58","author":[{"given":"Ron","family":"Levkovitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam","family":"Mitra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02032308_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01758841","volume":"8","author":"I. Adler","year":"1992","unstructured":"I. Adler and R.D.C. Monteiro, A geometric view of parametric linear programming, Algorithmica 8(1992)161\u2013176.","journal-title":"Algorithmica"},{"key":"BF02032308_CR2","unstructured":"A. Altman and J. Gondzio, An efficient implementation of higher order primal dual interior point method for large scale programming, Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01447, Poland (1992)."},{"key":"BF02032308_CR3","volume-title":"Implementing the simplex method: the initial basis, TR-90-32","author":"R.E. Bixby","year":"1990","unstructured":"R.E. Bixby, Implementing the simplex method: the initial basis, TR-90-32, Department of Mathematical Sciences, Rice University, Houston, TX 77251, USA (December 1990)."},{"key":"BF02032308_CR4","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1287\/opre.40.5.885","volume":"40","author":"R.E. Bixby","year":"1992","unstructured":"R.E. Bixby, J.W. Gregory, I.J. Lustig, R.E. Marsten and D.F. Shanno, A very large scale linear programming: a case study in combining interior point and simplex methods, Oper. Res. 40(1992)885\u2013897.","journal-title":"Oper. Res."},{"key":"BF02032308_CR5","series-title":"Technical Report","volume-title":"Recovering an optimal basis from an interior point solution","author":"R.E. Bixby","year":"1992","unstructured":"R.E. Bixby and M.J. Saltzman, Recovering an optimal basis from an interior point solution, Technical Report #607, Department of Mathematical Sciences, Clemson University, Clemson, South Carolina, USA (March 1992)."},{"key":"BF02032308_CR6","unstructured":"A.S. El-Bakry, R.A. Tapia and Y. Zhang, A study of indicators for identifying zero variables in interior point methods,ICIAM 91, Washington, DC (1991)."},{"key":"BF02032308_CR7","unstructured":"J. Forrest and J.A. Tomlin, OSL optimization subroutine library version 2.0,User Guide and Reference Manual (IBM, 1990)."},{"key":"BF02032308_CR8","series-title":"Technical Report","volume-title":"Interior-point methodology for linear programming: duality, sensitivity analysis and computational aspects","author":"B. Jansen","year":"1993","unstructured":"B. Jansen, C. Roos, T. Terlaky and J.Ph. Vial, Interior-point methodology for linear programming: duality, sensitivity analysis and computational aspects, Technical Report 93-28, Faculty of Technical Mathematics and Informatics, Delft University, Deflt, The Netherlands (1993)."},{"key":"BF02032308_CR9","unstructured":"D.M. Gay, Stopping tests that compute optimal solutions for interior point linear programming algorithms, Proceedings in Applied Mathematics Vol. 47:Advances in Numerical Partial Differential Equations and Optimization, Proc. 5th Mexico-US Workshop, ed. S. Gomez, J.P. Hennart and R.A. Tapia (Siam, 1991) pp. 17\u201342; Numerical Analysis Manuscript 89-11, AT&T Bell Labora-tories, Murray Hill, NJ 07974, USA (December 1989)."},{"key":"BF02032308_CR10","series-title":"Working Paper","volume-title":"Convergence behaviour of some interior point algorithms","author":"O. Guler","year":"1991","unstructured":"O. Guler and Y. Ye, Convergence behaviour of some interior point algorithms, Working Paper 91-4, The College of Business administration, The University of Iowa, Iowa City, IA (1991)."},{"key":"BF02032308_CR11","unstructured":"O. Guler, C. Roos, T. Terlaky and J.-Ph. Vial, Interior point approach to the theory of linear programming, Research Report 1992.3, Facult\u00e9 des Sciences Economiques et Sociales, Universit\u00e9 de Gen\u00e8ve (February 1992)."},{"key":"BF02032308_CR12","volume-title":"Integration of the interior point method within simplex: experiments in feasible basis recovery","author":"R. Levkovitz","year":"1991","unstructured":"R. Levkovitz, G. Mitra and M. Tamiz, Integration of the interior point method within simplex: experiments in feasible basis recovery,APMOD91 Symp., Brunel University, UK (January 1991)."},{"key":"BF02032308_CR13","volume-title":"Interior point methods for large scale linear programs, theory and computational algorithms","author":"R. Levkovitz","year":"1992","unstructured":"R. Levkovitz, Interior point methods for large scale linear programs, theory and computational algorithms, Ph.D. Thesis, Brunel University, Uxbridge, UK (October 1992)."},{"key":"BF02032308_CR14","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"J. Lustig","year":"1992","unstructured":"J. Lustig, W. Marsten and F. Shanno, On implementing Mehrotra's predictor corrector interior point method for linear programming, SIAM J. Optim. 2(1992)435\u2013439.","journal-title":"SIAM J. Optim."},{"key":"BF02032308_CR15","unstructured":"N. Megiddo, Switching from a primal dual Newton algorithm to a primal dual (interior) simplex algorithm, RJ 6327 (61996), Computer Science\/Mathematics, IBM Almaden Research Center, 650 Harry Road, San Jose, CA 95120-6099, USA (November 1988)."},{"key":"BF02032308_CR16","doi-asserted-by":"crossref","unstructured":"N. Megiddo and M. Shub, Boundary behaviour of interior point algorithms in linear programming, Math. Oper. Res. 14(1989).","DOI":"10.1287\/moor.14.1.97"},{"key":"BF02032308_CR17","doi-asserted-by":"crossref","unstructured":"N. Megiddo, On finding primal and dual optimal bases, ORSA J. Comp. 3(1991).","DOI":"10.1287\/ijoc.3.1.63"},{"key":"BF02032308_CR18","series-title":"Technical Report","volume-title":"High order methods and their performance","author":"S. Mehrotra","year":"1990","unstructured":"S. Mehrotra, High order methods and their performance, Technical Report 90-16R1, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60208-3119, USA (July 1990)."},{"key":"BF02032308_CR19","series-title":"Technical Report","volume-title":"On finding the optimal facet of linear programming","author":"S. Mehrotra","year":"1991","unstructured":"S. Mehrotra and Y. Ye, On finding the optimal facet of linear programming, Technical Report 91-10, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60208-3119, USA (June 1991)."},{"key":"BF02032308_CR20","doi-asserted-by":"crossref","unstructured":"G. Mitra, M. Tamiz and J. Yadegar, Experimental investigation of an interior search method within a simplex framework, Commun. ACM 21(1988).","DOI":"10.1145\/53580.214953"},{"key":"BF02032308_CR21","doi-asserted-by":"crossref","unstructured":"R.J. Vanderbei, ALPO: Another Linear Program Optimizer, ORSA J. Comput. 5(1993).","DOI":"10.1287\/ijoc.5.2.134"},{"key":"BF02032308_CR22","volume-title":"On the convergence of interior point methods to the centre of the solution set in linear programming","author":"Y. Zhang","year":"1991","unstructured":"Y. Zhang and A. Tapia, On the convergence of interior point methods to the centre of the solution set in linear programming, Department of Mathematics and Statistics, University of Maryland, Baltimore County Campus, Baltimore, MD 21228, USA (September 1991)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02032308.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02032308\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02032308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T20:18:26Z","timestamp":1586377106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02032308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["BF02032308"],"URL":"https:\/\/doi.org\/10.1007\/bf02032308","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}