{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T04:57:03Z","timestamp":1750136223174},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,19]],"date-time":"2017-01-19T00:00:00Z","timestamp":1484784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s12351-017-0291-z","type":"journal-article","created":{"date-parts":[[2017,1,19]],"date-time":"2017-01-19T20:49:13Z","timestamp":1484858953000},"page":"297-316","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computational complexity of the exterior point simplex algorithm"],"prefix":"10.1007","volume":"19","author":[{"given":"Sophia","family":"Voulgaropoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Samaras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Sifaleras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,19]]},"reference":[{"key":"291_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01580643","volume":"35","author":"E Berenguer","year":"1986","unstructured":"Berenguer E, Smith L (1986) The expected number of extreme points of a random linear program. Math Program 35:129\u2013134","journal-title":"Math Program"},{"issue":"1","key":"291_CR2","first-page":"157","volume":"26","author":"K Borgwardt","year":"1982","unstructured":"Borgwardt K (1982a) The average number of pivot steps required by the simplex method is polynomial. Z Oper Res 26(1):157\u2013177","journal-title":"Z Oper Res"},{"issue":"3","key":"291_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1287\/moor.7.3.441","volume":"7","author":"K Borgwardt","year":"1982","unstructured":"Borgwardt K (1982b) Some distribution independent results about the asymptotic order of the average number of pivot steps in the simplex method. Math Oper Res 7(3):441\u2013462","journal-title":"Math Oper Res"},{"key":"291_CR4","doi-asserted-by":"publisher","first-page":"200","DOI":"10.2307\/1905523","volume":"3\u20134","author":"G Dantzig","year":"1949","unstructured":"Dantzig G (1949) Programming of interdependent activities: II, mathematical model. Econometrica 3\u20134:200\u2013211","journal-title":"Econometrica"},{"key":"291_CR5","doi-asserted-by":"publisher","DOI":"10.7249\/R366","volume-title":"Linear programming and extensions","author":"G Dantzig","year":"1963","unstructured":"Dantzig G (1963) Linear programming and extensions. Princeton University Press, Princeton"},{"key":"291_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/9781118625590","volume-title":"Smith H applied regression analysis","author":"N Draper","year":"1998","unstructured":"Draper N (1998) Smith H applied regression analysis, 3rd edn. Wiley, New York","edition":"3"},{"issue":"3,4","key":"291_CR7","first-page":"409","volume":"37","author":"J Durbin","year":"1950","unstructured":"Durbin J, Watson G (1950) Testing for serial correlation in least squares regression I. Biometrika 37(3,4):409\u2013428","journal-title":"Biometrika"},{"issue":"1","key":"291_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.2307\/2340521","volume":"85","author":"R Fisher","year":"1922","unstructured":"Fisher R (1922) On the interpretation of \n                    \n                      \n                    \n                    $$\\chi ^2$$\n                    \n                      \n                        \n                          \u03c7\n                          2\n                        \n                      \n                    \n                   from contingency tables and the calculation of P. J R Stat Soc 85(1):87\u201394","journal-title":"J R Stat Soc"},{"issue":"8","key":"291_CR9","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1080\/02331934.2013.765422","volume":"62","author":"T Glavelis","year":"2013","unstructured":"Glavelis T, Samaras N (2013) An experimental investigation of a primal-dual exterior point simplex algorithm. Optim: J Math Program Oper Res 62(8):1143\u20131152","journal-title":"Optim: J Math Program Oper Res"},{"issue":"4","key":"291_CR10","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.2307\/2531779","volume":"45","author":"D Hosmer","year":"1989","unstructured":"Hosmer D, Jovanovic B, Lemeshow S (1989) Best subsets logistic regression. Biometrics 45(4):1265\u20131270","journal-title":"Biometrics"},{"issue":"4","key":"291_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4(4):373\u2013395","journal-title":"Combinatorica"},{"key":"291_CR12","first-page":"191","volume":"20","author":"L Khachiyan","year":"1979","unstructured":"Khachiyan L (1979) A polynomial algorithm in linear programming. Sov Math Dokl 20:191\u2013194","journal-title":"Sov Math Dokl"},{"key":"291_CR13","series-title":"Academic Press","first-page":"159","volume-title":"Inequalities","author":"V Klee","year":"1972","unstructured":"Klee V, Minty G (1972) How good is the simplex algorithm? In: Shisha O (ed) Inequalities, vol III. Academic Press, New York, NY, pp 159\u2013175"},{"key":"291_CR14","volume-title":"Applied linear statistical models","author":"M Kutner","year":"2004","unstructured":"Kutner M, Neter J, Nachtsheim C, Wasserman W (2004) Applied linear statistical models, 5th edn. McGraw-Hill, New York","edition":"5"},{"key":"291_CR15","unstructured":"Linear Programming Test Problems. \n                    http:\/\/www.sztaki.hu\/~meszaros\/public_ftp\/lptestset\/misc\n                    \n                  . Last checked on 05 Oct 2016"},{"key":"291_CR16","unstructured":"Maros I, Khaliq M (1999) Advances in design and implementation of optimization software. Technical report"},{"key":"291_CR17","unstructured":"Mathworks MATLAB. \n                    http:\/\/www.mathworks.com\/products\/matlab\n                    \n                  . Last checked on 05 Oct 2016"},{"key":"291_CR18","doi-asserted-by":"crossref","unstructured":"McGeoch C, Sanders P, Fleischer R, Cohen PR, Precup D (2002) Using finite experiments to study asymptotic performance. In: Experimental algorithmics. Springer, pp 93\u2013126","DOI":"10.1007\/3-540-36383-1_5"},{"key":"291_CR19","unstructured":"Minitab. \n                    http:\/\/www.minitab.com\/en-us\/academic\n                    \n                  . Last checked on 05 Oct 2016"},{"key":"291_CR20","unstructured":"NETLIB, netlib benchmark lps. \n                    http:\/\/www.netlib.org\/benchmark\n                    \n                  . Last checked on 05 Oct 2016"},{"key":"291_CR21","unstructured":"NIST, National Institute of Standards and Technology. \n                    http:\/\/www.nist.gov\n                    \n                  . Last checked on 5 Oct 2016"},{"key":"291_CR22","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01586925","volume":"51","author":"K Paparrizos","year":"1991","unstructured":"Paparrizos K (1991) An infeasible exterior point simple algorithm for assignment problems. Math Program 51:45\u201354","journal-title":"Math Program"},{"key":"291_CR23","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/BF02023111","volume":"47","author":"K Paparrizos","year":"1993","unstructured":"Paparrizos K (1993) An exterior point simplex algorithm for (general) linear programming problems. Ann Oper Res 47:497\u2013508","journal-title":"Ann Oper Res"},{"key":"291_CR24","unstructured":"Paparrizos K, Samaras N, Stephanides G (2000) A method for generating random optimal linear problems and a comparative computational study. In: Proceedings of the 13th national conference of the Hellenic operational research society, Piraeus, pp 785\u2013794 (in Greek)"},{"issue":"2","key":"291_CR25","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0377-2217(02)00400-9","volume":"148","author":"K Paparrizos","year":"2003","unstructured":"Paparrizos K, Samaras N, Stephanides N (2003a) An efficient simplex type algorithm for sparse and dense linear problems. Eur J Oper Res 148(2):323\u2013334","journal-title":"Eur J Oper Res"},{"issue":"9","key":"291_CR26","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1016\/S0305-0548(02)00077-1","volume":"30","author":"K Paparrizos","year":"2003","unstructured":"Paparrizos K, Samaras N, Stephanides N (2003b) A new efficient primal dual simplex algorithm. Comput Oper Res 30(9):1383\u20131339","journal-title":"Comput Oper Res"},{"issue":"1","key":"291_CR27","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10479-014-1769-1","volume":"229","author":"K Paparrizos","year":"2015","unstructured":"Paparrizos K, Samaras N, Sifaleras A (2015) Exterior point simplex-type algorithms for linear and network optimization problems. Ann Oper Res 229(1):607\u2013633","journal-title":"Ann Oper Res"},{"issue":"2","key":"291_CR28","first-page":"253","volume":"14","author":"J Pri\u0161enk","year":"2014","unstructured":"Pri\u0161enk J, Turk J, Rozman \u010cr, Borec A, Zraki\u0107 M, Pa\u017eek K (2014) Advantages of combining linear programming and weighted goal programming for agriculture application. Oper Res 14(2):253\u2013260","journal-title":"Oper Res"},{"key":"291_CR29","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316436","volume-title":"Coefficient of determination, linear statistical inference and its applications","author":"C Rao","year":"1973","unstructured":"Rao C (1973) Coefficient of determination, linear statistical inference and its applications, 2nd edn. Wiley, New York","edition":"2"},{"issue":"1","key":"291_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/biomet\/6.1.1","volume":"6","author":"Student","year":"1908","unstructured":"Student (1908) The probable error of a mean. Biometrika 6(1):1\u201325","journal-title":"Biometrika"},{"issue":"10","key":"291_CR31","doi-asserted-by":"publisher","first-page":"2136","DOI":"10.1080\/02331934.2014.926356","volume":"64","author":"C Triantafyllidis","year":"2015","unstructured":"Triantafyllidis C, Samaras N (2015) Three nearly scaling invariant versions of an exterior point algorithm for linear programming. Optim: J Math Program Oper Res 64(10):2136\u20132181","journal-title":"Optim: J Math Program Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0291-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-017-0291-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0291-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:57:55Z","timestamp":1559383075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-017-0291-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,19]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["291"],"URL":"https:\/\/doi.org\/10.1007\/s12351-017-0291-z","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,19]]},"assertion":[{"value":"12 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}