{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T21:46:19Z","timestamp":1705095979363},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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":[[1996,4]]},"DOI":"10.1007\/bf02592100","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:55:46Z","timestamp":1175183746000},"page":"111-127","source":"Crossref","is-referenced-by-count":15,"title":["Speeding up Karmarkar's algorithm for multicommodity flows"],"prefix":"10.1007","volume":"73","author":[{"given":"Sanjiv","family":"Kapoor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pravin M.","family":"Vaidya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02592100_CR1","volume-title":"Computing block-angular Karmarkar projections with applications to stochastic programming","author":"J. Birge","year":"1986","unstructured":"J. Birge and L. Qi, \u201cComputing block-angular Karmarkar projections with applications to stochastic programming,\u201d Technical Report, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI, 1986)"},{"key":"BF02592100_CR2","volume-title":"Linear Programming","author":"V. Chvatal","year":"1983","unstructured":"V. Chvatal,Linear Programming (Freeman, New York, 1983)."},{"key":"BF02592100_CR3","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1983","unstructured":"G.H. Golub and C.F. Van Loan,Matrix Computations (The Johns Hopkins University Press, Baltimore, MA, 1983)."},{"key":"BF02592100_CR4","volume-title":"Integer Programming and Network Flows","author":"T.C. Hu","year":"1969","unstructured":"T.C. Hu,Integer Programming and Network Flows (Addison-Wesley, Reading, MA, 1969)."},{"key":"BF02592100_CR5","doi-asserted-by":"crossref","unstructured":"S. Kapoor and P.M. Vaidya, \u201cFast algorithms for convex quadratic programming and multicommodity flows,\u201dProceedings 18th Annual ACM Symposium Theory of Computing (1986), pp. 147\u2013159.","DOI":"10.1145\/12130.12145"},{"issue":"4","key":"BF02592100_CR6","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\u201d,Combinatorica 4(4) (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"BF02592100_CR7","first-page":"191","volume":"20","author":"L.G. Khachian","year":"1979","unstructured":"L.G. Khachian, \u201cPolynomial algorithms in linear programming\u201d,USSR Computational Mathematics and Mathematical Physics 20 (1979) 191\u2013194.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"BF02592100_CR8","first-page":"1051","volume":"5","author":"M.K. Kozlov","year":"1979","unstructured":"M.K. Kozlov, S.P. Tarasov and L.G. Khachian, \u201cPolynomial solvability of convex quadratic programming\u201d,Doklady Akademii Nauk SSSR 5 (1979) 1051\u20131053.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"BF02592100_CR9","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982)."},{"key":"BF02592100_CR10","volume-title":"Introduction to Matrix Computations","author":"G.W. Stewar","year":"1973","unstructured":"G.W. Stewar,Introduction to Matrix Computations (Academic Press, New York, 1973)."},{"key":"BF02592100_CR11","doi-asserted-by":"crossref","unstructured":"P.M. Vaidya, \u201cAn algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations,\u201d in:Proceedings 19th Annual ACM Symposium Theory of Computing (1987) pp. 29\u201338. |Extended version in:Mathematical Programming 47 (1990) 175\u2013201.","DOI":"10.1007\/BF01580859"},{"key":"BF02592100_CR12","volume-title":"The Algebraic Eigenvalue Problem","author":"J.H. Wilkinson","year":"1965","unstructured":"J.H. Wilkinson,The Algebraic Eigenvalue Problem (Oxford University Press, Oxford, 1965)."},{"key":"BF02592100_CR13","volume-title":"Mathematical Programming Methods","author":"G. Zoutendijk","year":"1976","unstructured":"G. Zoutendijk,Mathematical Programming Methods (North-Holland, New York, 1976)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592100.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592100\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:52Z","timestamp":1558395472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["BF02592100"],"URL":"https:\/\/doi.org\/10.1007\/bf02592100","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}