{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T18:32:56Z","timestamp":1785954776376,"version":"3.56.0"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1984,12,1]],"date-time":"1984-12-01T00:00:00Z","timestamp":470707200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1984,12]]},"DOI":"10.1007\/bf02579150","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T17:14:52Z","timestamp":1174583692000},"page":"373-395","source":"Crossref","is-referenced-by-count":2921,"title":["A new polynomial-time algorithm for linear programming"],"prefix":"10.1007","volume":"4","author":[{"given":"N.","family":"Karmarkar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02579150_CR1","unstructured":"H. S. M. Coxeter,Introduction to Geometry, Wiley (1961)."},{"key":"BF02579150_CR2","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":"BF02579150_CR3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz andA. Schrijver, The Ellipsoid Method and its Consequences in Combinatorial Optimization,Combinatorica 1 (1981), 169\u2013197.","journal-title":"Combinatorica"},{"issue":"S","key":"BF02579150_CR4","first-page":"1093","volume":"244","author":"L. G. Khachiyan","year":"1979","unstructured":"L. G. Khachiyan, A polynomial Algorithm in Linear Programming,Doklady Akademii Nauk SSSR 244:S (1979), 1093\u20131096, translated inSoviet Mathematics Doklady 20:1 (1979), 191\u2013194.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"BF02579150_CR5","first-page":"159","volume-title":"Inequalities III","author":"V. Klee","year":"1972","unstructured":"V. Klee andG. L. Minty, How good is the simplex algorithm? inInequalities III, (ed. O. Shisha) Academic Press, New York, 1972, 159\u2013179."},{"key":"BF02579150_CR6","volume-title":"Projective Geometry, 1\u20132","author":"O. Veblen","year":"1938","unstructured":"O. Veblen andJ. W. Young,Projective Geometry, 1\u20132, Blaisdell, New York, (1938)."},{"key":"BF02579150_CR7","unstructured":"R. J. Walker,Algebraic Curves, Princeton University Press (1950)."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579150.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579150\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579150","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:44:58Z","timestamp":1558183498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,12]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1984,12]]}},"alternative-id":["BF02579150"],"URL":"https:\/\/doi.org\/10.1007\/bf02579150","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,12]]}}}