{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:52:52Z","timestamp":1772297572322,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":[[1989,5]]},"DOI":"10.1007\/bf01587095","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:09:28Z","timestamp":1114679368000},"page":"297-335","source":"Crossref","is-referenced-by-count":268,"title":["An implementation of Karmarkar's algorithm for linear programming"],"prefix":"10.1007","volume":"44","author":[{"given":"Ilan","family":"Adler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geraldo","family":"Veiga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narendra","family":"Karmarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"I. Adler, N. Karmarkar, M.G.C. Resende and G. Veiga, \u201cData structures and programming techniques for the implementation of Karmarkar's algorithm,\u201dORSA Journal on Computing 1(2) (1989).","DOI":"10.1287\/ijoc.1.2.84"},{"key":"CR2","volume-title":"\u201cLimiting behaviour of the affine-scaling continuous trajectories for linear programming problems,\u201d Report ESRC 88-9","author":"I. Adler","year":"1988","unstructured":"I. Adler and R.C. Monteiro, \u201cLimiting behaviour of the affine-scaling continuous trajectories for linear programming problems,\u201d Report ESRC 88-9, Engineering Systems Research Center, University of California (Berkeley, CA, 1988)."},{"key":"CR3","volume-title":"\u201cMnetgn program documentation,\u201d Technical Report IEOR 77003","author":"A.I. Ali","year":"1977","unstructured":"A.I. Ali and J.L. Kennington, \u201cMnetgn program documentation,\u201d Technical Report IEOR 77003, Department of Industrial Engineering and Operations Research, Southern Methodist University (Dallas, TX, 1977)."},{"key":"CR4","volume-title":"\u201cThe projective transformation algorithm by Karmarkar: A computational experiment with assignment problems,\u201d Technical Report 85-OR-3","author":"J. Aronson","year":"1985","unstructured":"J. Aronson, R. Barr, R. Helgason, J. Kennington, A. Loh and H. Zaki, \u201cThe projective transformation algorithm by Karmarkar: A computational experiment with assignment problems,\u201d Technical Report 85-OR-3, Department of Operations Research, Southern Methodist University (Dallas, TX, August 1985)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"E.R. Barnes, \u201cA variation on Karmarkar's algorithm for solving linear programming problems,\u201dMathematical Programming 36 (1986) 174\u2013182.","journal-title":"Mathematical Programming"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"D.A. Bayer and J.C. Lagarias, \u201cThe nonlinear geometry of linear programming: I. Affine and projective rescaling trajectories,\u201d to appear in Transactions of the AMS (1989).","DOI":"10.2307\/2001396"},{"key":"CR7","volume-title":"\u201cOn the work needed to factor a symmetric positive definite matrix,\u201d Technical Report ORC 87-14","author":"M.L. Carvalho de","year":"1987","unstructured":"M.L. de Carvalho, \u201cOn the work needed to factor a symmetric positive definite matrix,\u201d Technical Report ORC 87-14, Operations Research Center, University of California (Berkeley, CA, 1987)."},{"key":"CR8","series-title":"Research Memorandum","volume-title":"A class of algorithms for linear programming","author":"V. Chandru","year":"1986","unstructured":"V. Chandru and B.S. Kochar, \u201cA class of algorithms for linear programming,\u201d Research Memorandum 85-14, School of industrial Engineering, Purdue University (West Lafayette, IN, 1986)."},{"key":"CR9","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \u201cIterative solution of problems of linear and quadratic programming,\u201dSoviet Mathematics Doklady 8 (1967) 674\u2013675.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/22899.22904","volume":"30","author":"J.J. Dongarra","year":"1987","unstructured":"J.J. Dongarra and E. Grosse, \u201cDistribution of mathematical software via electronic mail,\u201dCommunications of the ACM 30 (1987) 403\u2013414.","journal-title":"Communications of the ACM"},{"key":"CR11","volume-title":"Direct Methods for Sparse Matrices","author":"I.S. Duff","year":"1986","unstructured":"I.S. Duff, A.M. Erisman and J.K. Reid,Direct Methods for Sparse Matrices (Claredon Press, Oxford, 1986)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1002\/nme.1620180804","volume":"18","author":"S.C. Eisenstat","year":"1982","unstructured":"S.C. Eisenstat, M.C. Gurshy, M.H. Schultz and A.H. Sherman, \u201cThe Yale sparse matrix package, I. The symmetric codes,\u201dInternational Journal of Numerical Methods in Engineering 18 (1982) 1145\u20131151.","journal-title":"International Journal of Numerical Methods in Engineering"},{"key":"CR13","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems,\u201dMathematical Programming Society Committee on Algorithms Newsletter 13 (December 1985) 10\u201312.","journal-title":"Mathematical Programming Society Committee on Algorithms Newsletter"},{"key":"CR14","volume-title":"\u201cElectronic mail distribution of linear programming test problems,\u201d Numerical Analysis Manuscript 86-0","author":"D.M. Gay","year":"1986","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems,\u201d Numerical Analysis Manuscript 86-0, AT&T Bell Laboratories (Murray Hill, NJ, 1986)."},{"key":"CR15","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, \u201cOn projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,\u201dMathematical Programming 36 (1986) 183\u2013209.","journal-title":"Mathematical Programming"},{"key":"CR16","volume-title":"\u201cInterior point algorithms for linear programming problems with inequality constraints,\u201d Report ES-140\/88","author":"C. Gonzaga","year":"1988","unstructured":"C. Gonzaga, \u201cInterior point algorithms for linear programming problems with inequality constraints,\u201d Report ES-140\/88, COPPE-Federal University of Rio de Janeiro (Rio de Janeiro, Brazil, 1988)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01589349","volume":"20","author":"J.K. Ho","year":"1981","unstructured":"J.K. Ho and E. Loute, \u201cA set of staircase linear programming test problems,\u201dMathematical Programming 20 (1981) 245\u2013250.","journal-title":"Mathematical Programming"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1287\/inte.16.4.75","volume":"16","author":"J.H. Hooker","year":"1986","unstructured":"J.H. Hooker, \u201cKarmarkar's linear programming algorithm,\u201dInterfaces 16 (1986) 75\u201390.","journal-title":"Interfaces"},{"key":"CR19","volume-title":"\u201cForplan version 1: An overview,\u201d Technical Report","author":"K.N. Johnson","year":"1986","unstructured":"K.N. Johnson, \u201cForplan version 1: An overview,\u201d Technical Report, Land Management Planning-System Section, USDA, Forest Service (Fort Collins, CO, 1986)."},{"key":"CR20","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":"CR21","volume-title":"\u201cPower series variants of Karmarkar type algorithms,\u201d Technical Report","author":"N. Karmarkar","year":"1989","unstructured":"N. Karmarkar, J. Lagarias, L. Slutsman and P. Wang, \u201cPower series variants of Karmarkar type algorithms,\u201d Technical Report, AT&T Bell Laboratories (Murray Hill, NJ, 1989)."},{"key":"CR22","volume-title":"\u201cA primal partitioning code for solving multicommodity flow problems (version 1),\u201d Technical Report 79008","author":"J. Kennington","year":"1979","unstructured":"J. Kennington, \u201cA primal partitioning code for solving multicommodity flow problems (version 1),\u201d Technical Report 79008, Department of Industrial Engineering and Operations Research, Southern Methodist University (Dallas, TX, 1979)."},{"key":"CR23","volume-title":"\u201cA practical approach to Karmarkar's algorithm,\u201d Technical Report SOL 85-5","author":"I.J. Lustig","year":"1985","unstructured":"I.J. Lustig, \u201cA practical approach to Karmarkar's algorithm,\u201d Technical Report SOL 85-5, Systems Optimization Laboratory, Stanford University (Stanford, CA, 1985)."},{"key":"CR24","volume-title":"\u201cBoundary behavior of interior point algorithms for linear programming,\u201d IBM Research Report RJ5319","author":"N. Megiddo","year":"1986","unstructured":"N. Megiddo and M. Shub, \u201cBoundary behavior of interior point algorithms for linear programming,\u201d IBM Research Report RJ5319, Almad\u00e9n Research Center (San Jose, CA, 1986)."},{"key":"CR25","volume-title":"\u201cMinos user's guide,\u201d Technical Report 77-9","author":"B.A. Murtagh","year":"1977","unstructured":"B.A. Murtagh and M.A. Saunders, \u201cMinos user's guide,\u201d Technical Report 77-9, Systems Optimization Laboratory, Stanford University (Stanford, CA, 1977)."},{"key":"CR26","volume-title":"\u201cMinos 5.0 user's guide,\u201d Technical Report 83-20","author":"B.A. Murtagh","year":"1983","unstructured":"B.A. Murtagh and M.A. Saunders, \u201cMinos 5.0 user's guide,\u201d Technical Report 83-20, Systems Optimization Laboratory, Stanford University (Stanford, CA, 1983)."},{"key":"CR27","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/B978-1-4832-3187-7.50018-0","volume-title":"Graph Theory and Computing","author":"D.J. Rose","year":"1972","unstructured":"D.J. Rose, \u201cA graph-theoretical study of the numerical solution of sparse positive definite systems of linear equations,\u201d in: R.C. Read, ed.,Graph Theory and Computing (Academic Press, New York, 1972) pp. 183\u2013217."},{"key":"CR28","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"R.E. Tarjan,Data Structures and Network Algorithms (Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983)."},{"key":"CR29","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, \u201cAn extension of Karmarkar's algorithm for linear programming using dual variables,\u201dAlgorithmica 1 (1986) 409\u2013424.","journal-title":"Algorithmica"},{"key":"CR30","volume-title":"An experimental approach to Karmarkar's projective method for linear programming","author":"J.A. Tomlin","year":"1985","unstructured":"J.A. Tomlin, \u201cAn experimental approach to Karmarkar's projective method for linear programming,\u201d Manuscript, Ketron, Inc. (Mountain View, CA, 1985)."},{"key":"CR31","volume-title":"\u201cAn implementation of a revised Karmarkar method,\u201d Interim Report","author":"K. Tone","year":"1986","unstructured":"K. Tone, \u201cAn implementation of a revised Karmarkar method,\u201d Interim Report, Graduate School for Policy Science, Saitama University (Urawa, Saitama 338, Japan, 1986)."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"R.J. Vanderbei, M.J. Meketon and B.A. Freedman, \u201cA modification of Karmarkar's linear programming algorithm,\u201dAlgorithmica 1 (1986) 395\u2013407.","journal-title":"Algorithmica"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M. Yannakakis","year":"1981","unstructured":"M. Yannakakis, \u201cComputing the minimum fill-in is NP-complete,\u201dSIAM Journal on Algebraic and Discrete Methods 2 (1981) 77\u201379.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01587095.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01587095\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01587095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:52:11Z","timestamp":1586231531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01587095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":33,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["BF01587095"],"URL":"https:\/\/doi.org\/10.1007\/bf01587095","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}