{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:33:08Z","timestamp":1649104388928},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1016\/j.ejor.2017.10.051","type":"journal-article","created":{"date-parts":[[2017,10,31]],"date-time":"2017-10-31T18:07:15Z","timestamp":1509473235000},"page":"1182-1183","source":"Crossref","is-referenced-by-count":0,"title":["A review of \u201clinear programming computation\u201d by Ping-Qi Pan"],"prefix":"10.1016","volume":"267","author":[{"given":"Yangyang","family":"Shi","sequence":"first","affiliation":[]},{"given":"Lei-Hong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wenxing","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2017.10.051_bib0001","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10589-007-9022-3","article-title":"Progress in the dual simplex method for large scale LP problems: Practical dual phase-1 algorithms","volume":"37","author":"Koberstein","year":"2007","journal-title":"Computational Optimization and Applications"},{"issue":"1","key":"10.1016\/j.ejor.2017.10.051_bib0002","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/S0377-2217(96)00027-6","article-title":"The most-obtuse-angle row pivot rule for achieving dual feasibility in linear programming: A computational study","volume":"101","author":"Pan","year":"1997","journal-title":"European Journal of Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2017.10.051_bib0003","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0898-1221(98)00127-8","article-title":"A basis-deficiency-allowing variation of the simplex method","volume":"36","author":"Pan","year":"1998","journal-title":"Computers and Mathematics with Applications"},{"issue":"1","key":"10.1016\/j.ejor.2017.10.051_bib0004","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/030602253","article-title":"A revised dual projective pivot algorithm for linear programming","volume":"16","author":"Pan","year":"2005","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/j.ejor.2017.10.051_bib0005","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1016\/j.amc.2007.07.030","article-title":"A primal deficient-basis algorithm for linear programming","volume":"198","author":"Pan","year":"2008","journal-title":"Applied Mathematics and Computation"},{"key":"10.1016\/j.ejor.2017.10.051_bib0006","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.orl.2007.10.001","article-title":"Efficient nested pricing in the simplex algorithm","volume":"38","author":"Pan","year":"2008","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.ejor.2017.10.051_bib0007","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.ejor.2007.03.026","article-title":"A largest-distance pivot rule for the Simplex Algorithm","volume":"187","author":"Pan","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2017.10.051_bib0008","doi-asserted-by":"crossref","DOI":"10.4208\/jcm.3105-m2897","article-title":"A fast simplex algorithm for linear programming","volume":"2","author":"Pan","year":"2010","journal-title":"Journal of Computational Mathematics"},{"key":"10.1016\/j.ejor.2017.10.051_bib0009","series-title":"Linear programming computation","author":"Pan","year":"2014"},{"issue":"4","key":"10.1016\/j.ejor.2017.10.051_bib0010","doi-asserted-by":"crossref","first-page":"335","DOI":"10.4208\/jcm.1301-m4106","article-title":"On an efficient implementation of the face algorithm for linear programming","volume":"31","author":"Zhang","year":"2013","journal-title":"Journal of Computational Mathematics"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221717309645?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221717309645?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T11:31:40Z","timestamp":1570275100000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221717309645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["S0377221717309645"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2017.10.051","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}