{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T12:26:54Z","timestamp":1692448014695},"reference-count":21,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0305-0548(02)00077-1","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T22:25:53Z","timestamp":1048631153000},"page":"1383-1399","source":"Crossref","is-referenced-by-count":25,"title":["A new efficient primal dual simplex algorithm"],"prefix":"10.1016","volume":"30","author":[{"given":"Konstantinos","family":"Paparrizos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Samaras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Stephanides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0305-0548(02)00077-1_BIB1","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/moor.7.3.441","article-title":"Some distribution-independent results about the asymptotic order of the average number of pivot steps of the simplex algorithm","volume":"7","author":"Borgwardt","year":"1982","journal-title":"Mathematics of Operations Research"},{"issue":"5","key":"10.1016\/S0305-0548(02)00077-1_BIB2","first-page":"157","article-title":"The average number of pivot steps required by the simplex method is polynomial","volume":"26","author":"Borgwardt","year":"1982","journal-title":"Zeitschrift fur Operational Research, Series A: Theory"},{"key":"10.1016\/S0305-0548(02)00077-1_BIB3","unstructured":"Klee V, Minty GJ. How good is the simplex algorithm? In: Shisha O, editor. Inequalities III. New York: Academic Press; 158\u201372."},{"key":"10.1016\/S0305-0548(02)00077-1_BIB4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00249643","article-title":"Multiple centrality corrections in a primal-dual method for linear programming","volume":"6","author":"Gondzio","year":"1996","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/S0305-0548(02)00077-1_BIB5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1080\/02331939208843796","article-title":"Splitting dense columns of constraint matrix in interior point methods for large-scale linear programming","volume":"24","author":"Gondzio","year":"1992","journal-title":"Optimization"},{"key":"10.1016\/S0305-0548(02)00077-1_BIB6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/S0305-0548(02)00077-1_BIB7","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","article-title":"On implementing Mehrotra's predictor-corrector interior point method for linear programming","volume":"2","author":"Lustig","year":"1992","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/S0305-0548(02)00077-1_BIB8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01586925","article-title":"An infeasible exterior point simplex algorithm for assignment problems","volume":"51","author":"Paparrizos","year":"1991","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(02)00077-1_BIB9","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/BF02023111","article-title":"An exterior point simplex algorithm for general linear problems","volume":"32","author":"Paparrizos","year":"1993","journal-title":"Annals of Operation Research"},{"key":"10.1016\/S0305-0548(02)00077-1_BIB10","first-page":"445","article-title":"A new primal and dual pivoting rule for the simplex algorithm","volume":"1","author":"Paparrizos","year":"1996","journal-title":"Proceedings of SYMOPIS \u201996"},{"key":"10.1016\/S0305-0548(02)00077-1_BIB11","unstructured":"Paparrizos K. Pivoting algorithms generating two paths. Presented in ISMP \u201997, Lausanne, EPFL Switzerland 1997, Abstracts: 207."},{"key":"10.1016\/S0305-0548(02)00077-1_BIB12","unstructured":"Paparrizos K, Samaras N, Stephanides G. An efficient simplex type algorithm for sparse and dense linear programs. European Journal of Operations Research 2000, in press."},{"key":"10.1016\/S0305-0548(02)00077-1_BIB13","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/opre.42.3.556","article-title":"A monotonic build-up simplex algorithm for linear programming","volume":"42","author":"Anstreicher","year":"1994","journal-title":"Operation Research"},{"key":"10.1016\/S0305-0548(02)00077-1_BIB14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0167-6377(94)90023-X","article-title":"The simplex algorithm with a new primal and dual pivot rule","volume":"16","author":"Chen","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(02)00077-1_BIB15","first-page":"233","article-title":"A primal-dual simplex method for linear problems","volume":"16","author":"Curet","year":"1974","journal-title":"Operations Research Letters"},{"issue":"3","key":"10.1016\/S0305-0548(02)00077-1_BIB16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0167-6377(84)90003-8","article-title":"A feasible direction method for linear programming","volume":"3","author":"Murty","year":"1984","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(02)00077-1_BIB17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02096264","article-title":"Pivot rules for linear programming\u2014A survey","volume":"46","author":"Terlaky","year":"1993","journal-title":"Annals of Operations Research"},{"issue":"12","key":"10.1016\/S0305-0548(02)00077-1_BIB18","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1287\/mnsc.42.12.1719","article-title":"Combining interior-point and pivoting algorithms for linear programming","volume":"42","author":"Andersen","year":"1996","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/S0305-0548(02)00077-1_BIB19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/ijoc.3.1.63","article-title":"On finding primal and dual optimal bases","volume":"3","author":"Megiddo","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0305-0548(02)00077-1_BIB20","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0167-6377(96)00008-9","article-title":"Resolution of the problem of degeneracy in a primal and dual simplex algorithm","volume":"20","author":"Dosios","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(02)00077-1_BIB21","unstructured":"Samaras N. Computational improvements and efficient implementation of two path pivoting algorithms. Ph.D. thesis, University of Macedonia, Department of Applied Informatics, June 2001."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000771?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000771?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T03:21:10Z","timestamp":1554780070000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802000771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":21,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0305054802000771"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00077-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}