{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:46:39Z","timestamp":1751881599651},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"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":[[1988,5]]},"DOI":"10.1007\/bf01580755","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:52:50Z","timestamp":1114681970000},"page":"97-113","source":"Crossref","is-referenced-by-count":19,"title":["Exploiting special structure in Karmarkar's linear programming algorithm"],"prefix":"10.1007","volume":"41","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":"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":"CR3","volume-title":"A class of algorithms for linear programming","author":"V. Chandru","year":"1985","unstructured":"V. Chandru and B. Kochar, \u201cA class of algorithms for linear programming,\u201d manuscript, Department of Industrial Engineering, Purdue University, West Lafayette, IN (1985)."},{"key":"CR4","volume-title":"Linear programming and extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963)."},{"key":"CR5","volume-title":"Large scale linear programming","year":"1981","unstructured":"G.B. Dantzig, M.A.H. Dempster, and M.J. Kallio, eds.,Large scale linear programming (IIASA, Laxenburg, Austria, 1981)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(67)80015-1","volume":"1","author":"G.B. Dantzig","year":"1967","unstructured":"G.B. Dantzig and R.M. Van Slyke, \u201cGeneralized upper bounding techniques,\u201dJournal of Computer System Sciences 1(1967) 213\u2013226.","journal-title":"Journal of Computer System Sciences"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"767","DOI":"10.2307\/1911818","volume":"29","author":"G.B. Dantzig","year":"1961","unstructured":"G.B. Dantzig and P. Wolfe, \u201cThe decomposition algorithm for linear programming,\u201dEconometrica 29 (1961) 767\u2013778.","journal-title":"Econometrica"},{"key":"CR8","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":"CR9","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\u201c,Mathematical Programming 37 (1987) 81\u201390.","journal-title":"Mathematical Programming"},{"key":"CR10","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":"CR11","volume-title":"A conical projection algorithm for linear programming","author":"C. Gonzaga","year":"1985","unstructured":"C. Gonzaga, \u201cA conical projection algorithm for linear programming,\u201d manuscript, Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA (1985)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580655","volume":"20","author":"G.W. Graves","year":"1976","unstructured":"G.W. Graves and R.D. McBride, \u201cThe factorization approach to large-scale linear programming,\u201dMathematical Programming 20 (1976) 91\u2013110.","journal-title":"Mathematical Programming"},{"key":"CR13","unstructured":"D. Jensen and A. Steger, private communication, Department of Applied Mathematics and Statistics, State University of New York at Stonybrook, Stonybrook, New York (1985)."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"S. Kapoor and P.M. Vaidya, \u201cFast algorithms for convex quadratic programming and multicommodity flows,\u201d Proceedings of the 18th ACM Symposium on Theory of Computing (1986) 147\u2013159.","DOI":"10.1145\/12130.12145"},{"key":"CR15","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":"CR16","unstructured":"N. Karmarkar and L.P. Sinha, \u201cApplication of Karmarkar's algorithm to overseas telecommunications facilities planning,\u201d paper presented at XII International Symposium on Mathematical Programming, Boston (1985)."},{"key":"CR17","volume-title":"Optimization theory for large systems","author":"L.S. Lasdon","year":"1970","unstructured":"L.S. Lasdon,Optimization theory for large systems (Macmillan, New York, 1970)."},{"key":"CR18","volume-title":"Advanced linear programming: computation and practice","author":"B.A. Murtagh","year":"1981","unstructured":"B.A. Murtagh,Advanced linear programming: computation and practice (McGraw-Hill, New York, 1981)."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01840460","volume":"1","author":"G. Rinaldi","year":"1986","unstructured":"G. Rinaldi, \u201cA projective method for linear programming with box-type constraints,\u201dAlgorithmica 1 (1986) 517\u2013527.","journal-title":"Algorithmica"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/BFb0120715","volume":"14","author":"L. Schrage","year":"1975","unstructured":"L. Schrage, \u201cImplicit representation of variable upper bounds in linear programming,\u201dMathematical Programming Study 14 (1975) 118\u2013132.","journal-title":"Mathematical Programming Study"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01588948","volume":"14","author":"L. Schrage","year":"1978","unstructured":"L. Schrage, \u201cImplicit representation of generalized variable upper bounds in linear programming,\u201dMathematical Programming 14 (1978) 11\u201320.","journal-title":"Mathematical Programming"},{"key":"CR22","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":"CR23","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/BF01583778","volume":"23","author":"M.J. Todd","year":"1982","unstructured":"M.J. Todd, \u201cAn implementation of the simplex method for linear programming problems with variable upper bounds,\u201dMathematical Programming 23 (1982) 34\u201349.","journal-title":"Mathematical Programming"},{"key":"CR24","unstructured":"M.J. Todd, \u201cImproved bounds and containing ellipsoids in Karmarkar's linear programming algorithm,\u201d to appear inMathematics of Operations Research."},{"key":"CR25","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":"CR26","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"R.J. Vanderbei, M.S. Meketon and B.A. Freedman, \u201cA modification of Karmarkar's linear programming algorithm,\u201dAlgorithmica 1 (1986) 395\u2013407.","journal-title":"Algorithmica"},{"key":"CR27","unstructured":"Y. Ye and M. Kojima, \u201cRecovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming,\u201d to appear inMathematical Programming."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580755.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580755\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580755","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:11Z","timestamp":1556896331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580755"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":27,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["BF01580755"],"URL":"https:\/\/doi.org\/10.1007\/bf01580755","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}