{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:53:46Z","timestamp":1773752026684,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1973,4,1]],"date-time":"1973-04-01T00:00:00Z","timestamp":102470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":14717,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1973,4]]},"DOI":"10.1016\/0012-365x(73)90171-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"367-377","source":"Crossref","is-referenced-by-count":67,"title":["The simplex algorithm with the pivot rule of maximizing criterion improvement"],"prefix":"10.1016","volume":"4","author":[{"given":"R.G.","family":"Jeroslow","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(73)90171-4_BIB1","series-title":"Activity analysis of production and allocation","article-title":"Maximization of a linear function of variables subject to linear inequalities","volume":"13","author":"Dantzig","year":"1950"},{"key":"10.1016\/0012-365X(73)90171-4_BIB2","series-title":"Linear programming and extensions","author":"Danzig","year":"1963"},{"key":"10.1016\/0012-365X(73)90171-4_BIB3","series-title":"Convex polytopes","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/0012-365X(73)90171-4_BIB4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF01436525","article-title":"A class of linear programs requiring a large number of iterations","volume":"7","author":"Klee","year":"1965","journal-title":"Numer. Math."},{"key":"10.1016\/0012-365X(73)90171-4_BIB5","series-title":"Proc. IBM sci. computing symp. on combinatorial problems","first-page":"123","article-title":"Convex polytopes and linear programming","author":"Klee","year":"1966"},{"key":"10.1016\/0012-365X(73)90171-4_BIB6","series-title":"Inequalities III","article-title":"How good is the Simplex Algorithm?","author":"Klee","year":"1971"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X73901714?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X73901714?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:51:08Z","timestamp":1555138268000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X73901714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,4]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1973,4]]}},"alternative-id":["0012365X73901714"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(73)90171-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1973,4]]}}}