{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T10:49:12Z","timestamp":1762339752507},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,4,1]],"date-time":"1982-04-01T00:00:00Z","timestamp":386467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1982,4]]},"DOI":"10.1016\/0167-6377(82)90047-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"59-62","source":"Crossref","is-referenced-by-count":39,"title":["Complexity of linear programming"],"prefix":"10.1016","volume":"1","author":[{"given":"J.F.","family":"Traub","sequence":"first","affiliation":[]},{"given":"H.","family":"Wo\u017aniakowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(82)90047-5_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0167-6377(82)90047-5_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(80)90002-4","article-title":"Khachian's linear programming algorithm","volume":"1","author":"Aspvall","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-6377(82)90047-5_BIB3","series-title":"Comments on Khachian's algorithm for linear programming","author":"Dantzig","year":"1979"},{"key":"10.1016\/0167-6377(82)90047-5_BIB4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","article-title":"Systems of distinct representatives and linear algebra","volume":"71B","author":"Edmonds","year":"1967","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0167-6377(82)90047-5_BIB5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0167-6377(82)90047-5_BIB6","doi-asserted-by":"crossref","first-page":"589","DOI":"10.2307\/2316658","article-title":"How to solve linear inequalities","volume":"76","author":"Gale","year":"1969","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0167-6377(82)90047-5_BIB7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0167-6377(82)90047-5_BIB8_1","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"Khachian","year":"1979","journal-title":"Dokl. Akad. Nauk USSR"},{"key":"10.1016\/0167-6377(82)90047-5_BIB8_2","first-page":"191","volume":"20","author":"Khachian","year":"1979","journal-title":"Soviet Math. Dokl."},{"issue":"7","key":"10.1016\/0167-6377(82)90047-5_BIB9","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1002\/j.2326-1951.1980.tb01345.x","article-title":"The great mathematical sputnik of 1979","volume":"20","author":"Lawler","year":"1980","journal-title":"The Sciences"},{"issue":"3","key":"10.1016\/0167-6377(82)90047-5_BIB10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF03023055","article-title":"A new linear programming algorithm \u2014 Better or worse than the simplex method?","volume":"2","author":"Lov\u00e1sz","year":"1980","journal-title":"Math. Intelligence"},{"key":"10.1016\/0167-6377(82)90047-5_BIB11","series-title":"On a Soviet algorithm for the linear programming problem","author":"Traub","year":"1979"},{"key":"10.1016\/0167-6377(82)90047-5_BIB12","series-title":"A General Theory of Optimal Algorithms","author":"Traub","year":"1980"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900475?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900475?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T11:52:00Z","timestamp":1552909920000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637782900475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,4]]}},"alternative-id":["0167637782900475"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(82)90047-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1982,4]]}}}