{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T22:17:31Z","timestamp":1672438651032},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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":[[1993,3]]},"DOI":"10.1016\/0167-6377(93)90031-b","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"67-73","source":"Crossref","is-referenced-by-count":2,"title":["A timing model for the revised simplex method"],"prefix":"10.1016","volume":"13","author":[{"given":"James K","family":"Ho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.P","family":"Sundarraj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(93)90031-B_BIB1","series-title":"Linear Programming","author":"Chvatal","year":"1983"},{"key":"10.1016\/0167-6377(93)90031-B_BIB2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.2307\/2001993","article-title":"The product form for the inverse in the simplex method","volume":"8","author":"Dantzig","year":"1954","journal-title":"Mathematical Tables and Other Aids to Computation"},{"key":"10.1016\/0167-6377(93)90031-B_BIB3","article-title":"Electronic mail distribution of linear programming test problems","author":"Gay","year":"1985","journal-title":"COAL Newsletter"},{"key":"10.1016\/0167-6377(93)90031-B_BIB4_1","first-page":"135","article-title":"How many parts to make at once","volume":"10","author":"Harris","year":"1913","journal-title":"Factory, the Magazine of Management"},{"key":"10.1016\/0167-6377(93)90031-B_BIB4_2","first-page":"152","article-title":"How many parts to make at once","volume":"10","author":"Harris","year":"1913","journal-title":"Factory, the Magazine of Management"},{"key":"10.1016\/0167-6377(93)90031-B_BIB5","series-title":"Sparse Matrix and Their Applications","first-page":"67","article-title":"The partitioned preassigned pivot procedure","author":"Hellerman","year":"1972"},{"key":"10.1016\/0167-6377(93)90031-B_BIB6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1287\/trsc.14.4.295","article-title":"A successive linear optimization approach to the dynamic traffic assignment problem","volume":"14","author":"Ho","year":"1980","journal-title":"Transportation Sci."},{"key":"10.1016\/0167-6377(93)90031-B_BIB7","article-title":"Distributed algorithms for linear programming","author":"Sundarraj","year":"1990"},{"key":"10.1016\/0167-6377(93)90031-B_BIB8","author":"Tomlin","year":"1973"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390031B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390031B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:51:22Z","timestamp":1552902682000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779390031B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["016763779390031B"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(93)90031-b","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}