{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T07:18:32Z","timestamp":1718176712688},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":[[2003,7]]},"DOI":"10.1016\/s0377-2217(02)00400-9","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"323-334","source":"Crossref","is-referenced-by-count":19,"title":["An efficient simplex type algorithm for sparse and dense linear programs"],"prefix":"10.1016","volume":"148","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":[{"key":"10.1016\/S0377-2217(02)00400-9_BIB1","first-page":"12","article-title":"A comparative computational study with an exterior point simplex algorithm","volume":"1","author":"Alexouda","year":"1997","journal-title":"Proceedings of 4th Balkan Conference on Operational Research"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB2","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\/S0377-2217(02)00400-9_BIB3","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BFb0121192","article-title":"Notes on Bland\u2019s pivoting rule","volume":"8","author":"Avis","year":"1978","journal-title":"Mathematical Programming Study"},{"issue":"1","key":"10.1016\/S0377-2217(02)00400-9_BIB4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1287\/ijoc.6.1.15","article-title":"Progress in linear programming","volume":"6","author":"Bixby","year":"1994","journal-title":"ORSA journal of computing"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB5","article-title":"The simplex method: A probabilistic analysis","volume":"vol. 1","author":"Borgwardt","year":"1987"},{"issue":"5","key":"10.1016\/S0377-2217(02)00400-9_BIB6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0167-6377(92)90094-J","article-title":"The generalized simplex method","volume":"12","author":"Cardoso","year":"1992","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB7","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\/S0377-2217(02)00400-9_BIB8","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":"Operation Research Letters"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0902019","article-title":"Algorithms and data structures for sparse symmetric Gaussian elimination","volume":"2","author":"Eisenstat","year":"1981","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB10","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01581089","article-title":"Steepest-edge simplex algorithms for linear programming","volume":"57","author":"Forrest","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB11","unstructured":"J.R. Gilbert, C. Moler, R. Schreiber, Sparse matrices in MATLAB: Design and implementation, Technical Paper CS1 91-4, Xerox Palo Alto Research Center, 1990"},{"issue":"3","key":"10.1016\/S0377-2217(02)00400-9_BIB12","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1137\/0905041","article-title":"Sparse matrix methods in optimization","volume":"5","author":"Gill","year":"1984","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB13","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0166-218X(79)90004-0","article-title":"Worst case behavior of the steepest edge simplex method","volume":"1","author":"Goldfarb","year":"1979","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"10.1016\/S0377-2217(02)00400-9_BIB14","first-page":"739","article-title":"Another simplex type method for large scale linear programming","volume":"25","author":"Gondzio","year":"1996","journal-title":"Control and Cybernetics"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB15","series-title":"Inequalities III","first-page":"158","article-title":"How good is the simplex algorithm","author":"Klee","year":"1972"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB16","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1145\/53580.214953","article-title":"Experimental investigation of an interior search method within a simplex framework","volume":"31","author":"Mitra","year":"1988","journal-title":"Communications of ACM"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB17","first-page":"77","article-title":"Pivoting rules directing the Simplex method through all feasible vertices of Klee-Minty examples","volume":"26","author":"Paparrizos","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB18","unstructured":"K. Paparrizos, A generalization of an exterior point simplex algorithm for linear programming problems, Technical Report, University of Macedonia, 1990"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB19","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\/S0377-2217(02)00400-9_BIB20","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\/S0377-2217(02)00400-9_BIB21","first-page":"13","article-title":"Exterior point simplex algorithm: Simple and short proof of correctness","author":"Paparrizos","year":"1996","journal-title":"Proceedings of SYMOPIS\u201996"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB22","doi-asserted-by":"crossref","unstructured":"K. Paparrizos, N. Samaras, K. Tsiplidis, Pivoting algorithms for (LP) generating two paths, in: M.P. Pardalos, A.C. Floudas (Eds.), Encyclopedia of Optimization, vol. 4, Kluwer Academic Publishers, 2001, pp. 302\u2013306","DOI":"10.1007\/0-306-48332-7_388"},{"issue":"10","key":"10.1016\/S0377-2217(02)00400-9_BIB23","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1145\/63039.63042","article-title":"Random number generators: Good ones are hard to find","volume":"32","author":"Park","year":"1988","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB24","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF01585729","article-title":"An exponential example for Terlaky\u2019s pivoting rule for the Criss-cross Simplex method","volume":"46","author":"Roos","year":"1990","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/S0377-2217(02)00400-9_BIB25","doi-asserted-by":"crossref","first-page":"1337","DOI":"10.1137\/S1064827597328996","article-title":"Distributed Schur complement techniques for general sparse linear systems","volume":"21","author":"Saad","year":"1999","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"issue":"4","key":"10.1016\/S0377-2217(02)00400-9_BIB26","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1287\/ijoc.2.4.325","article-title":"Computing sparse LU factorization for large-scale linear programming bases","volume":"2","author":"Suhl","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB27","series-title":"Recent Advances in Mathematical Programming","article-title":"Methods for nonlinear programming","author":"Wolfe","year":"1963"},{"key":"10.1016\/S0377-2217(02)00400-9_BIB28","series-title":"Recent Advances in Mathematical Programming","first-page":"177","article-title":"Experiments in linear programming","author":"Wolfe","year":"1963"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004009?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004009?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:29:58Z","timestamp":1553945398000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702004009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0377221702004009"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00400-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}