{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T16:36:59Z","timestamp":1718815019921},"reference-count":127,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10479-014-1769-1","type":"journal-article","created":{"date-parts":[[2014,12,30]],"date-time":"2014-12-30T21:41:11Z","timestamp":1419975671000},"page":"607-633","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Exterior point simplex-type algorithms for linear and network optimization problems"],"prefix":"10.1007","volume":"229","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":"Angelo","family":"Sifaleras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,1]]},"reference":[{"key":"1769_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/9789812778215_0001","volume-title":"Combinatorial and global optimization, chap. Combinatorial and global optimization","author":"A Achatz","year":"2002","unstructured":"Achatz, A., Paparrizos, K., Samaras, N., & Tsiplidis, K. (2002). A forest exterior point algorithm for assignment problems. In M. P. Pardalos, A. Midgalas, & R. Buckard (Eds.), Combinatorial and global optimization, chap. Combinatorial and global optimization (pp. 1\u201310). Singapore: Word Scientific."},{"key":"1769_CR2","unstructured":"Achatz, H., Kleinschmidt, P., & Paparrizos, K. (1991). A dual forest algorithm for the assignment problem. In Applied geometry and discrete mathematics: The Victor Klee Festschrift (Vol. 4, pp. 1\u201310). London: AMS & ACM."},{"key":"1769_CR3","volume-title":"Network flows: Theory, algorithms and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms and applications. Englewood Cliffs, NJ: Prentice Hall."},{"key":"1769_CR4","first-page":"1","volume-title":"Network models, vol. 7, chap. Handbooks of operations research and management science","author":"RK Ahuja","year":"1995","unstructured":"Ahuja, R. K., Magnanti, T. L., Orlin, J. B., & Reddy, M. R. (1995). Applications of network optimization. In M. O. Ball, T. L. M. C. L. Monma, & G. L. Nemhauser (Eds.), Network models, vol. 7, chap. Handbooks of operations research and management science (pp. 1\u201383). Amsterdam: Elsevier, North-Holland."},{"issue":"Supp. No. 1","key":"1769_CR5","doi-asserted-by":"crossref","first-page":"S5","DOI":"10.1287\/opre.40.1.S5","volume":"40","author":"RK Ahuja","year":"1992","unstructured":"Ahuja, R. K., & Orlin, J. B. (1992). The scaling network simplex algorithm. Operations Research, 40(Supp. No. 1), S5\u2013S13.","journal-title":"Operations Research"},{"issue":"2","key":"1769_CR6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0166-218X(93)90054-R","volume":"45","author":"M Akg\u00fcl","year":"1993","unstructured":"Akg\u00fcl, M. (1993). A genuinely polynomial primal simplex algorithm for the assignment problem. Discrete Applied Mathematics, 45(2), 93\u2013115.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"1769_CR7","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ejor.2003.08.008","volume":"157","author":"AA Akkele\u015f","year":"2004","unstructured":"Akkele\u015f, A. A., Balogh, L., & Ille\u015b, T. (2004). New variants of the criss-cross method for linearly constrained convex quadratic programming. European Journal of Operational Research, 157(1), 74\u201386.","journal-title":"European Journal of Operational Research"},{"key":"1769_CR8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01581078","volume":"57","author":"KS Al-Sultan","year":"1992","unstructured":"Al-Sultan, K. S., & Murty, K. G. (1992). Exterior point algorithms for nearest points and convex quadratic programs. Mathematical Programming, 57, 145\u2013161.","journal-title":"Mathematical Programming"},{"issue":"2","key":"1769_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/ited.1090.0020","volume":"9","author":"A Alpers","year":"2009","unstructured":"Alpers, A., & Trotter, L. E. (2009). Teaching computational discrete optimization at the undergraduate level. INFORMS Transactions on Education, 9(2), 63\u201369.","journal-title":"INFORMS Transactions on Education"},{"issue":"1","key":"1769_CR10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.3844\/jcssp.2005.19.23","volume":"1","author":"D Andreou","year":"2005","unstructured":"Andreou, D., Paparrizos, K., Samaras, N., & Sifaleras, A. (2005). Application of a new network-enabled solver for the assignment problem in computer-aided education. Journal of Computer Science, 1(1), 19\u201323.","journal-title":"Journal of Computer Science"},{"issue":"3","key":"1769_CR11","first-page":"449","volume":"7","author":"D Andreou","year":"2007","unstructured":"Andreou, D., Paparrizos, K., Samaras, N., & Sifaleras, A. (2007). Visualization of the network exterior primal simplex algorithm for the minimum cost network flow problem. An International Journal of Operational Research, 7(3), 449\u2013464.","journal-title":"An International Journal of Operational Research"},{"key":"1769_CR12","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/BF02190122","volume":"91","author":"J Andrus","year":"1996","unstructured":"Andrus, J., & Schaferkotter, M. (1996). An exterior-point method for linear programming problems. Journal of Optimization Theory and Applications, 91, 561\u2013583.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"1769_CR13","unstructured":"Anstreicher, K.M., & Terlaky, T. (1991). A monotonic build-up simplex algorithm for linear programming. Technical Report 91\u201382, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands."},{"issue":"3","key":"1769_CR14","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/opre.42.3.556","volume":"42","author":"KM Anstreicher","year":"1994","unstructured":"Anstreicher, K. M., & Terlaky, T. (1994). A monotonic build-up simplex algorithm for linear programming. Operations Research, 42(3), 556\u2013561.","journal-title":"Operations Research"},{"issue":"2","key":"1769_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02614366","volume":"78","author":"RD Armstrong","year":"1997","unstructured":"Armstrong, R. D., & Jin, Z. (1997). A new strongly polynomial dual network simplex algorithm. Mathematical Programming, 78(2), 131\u2013148.","journal-title":"Mathematical Programming"},{"issue":"1","key":"1769_CR16","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1016\/j.amc.2006.10.020","volume":"188","author":"H Arsham","year":"2007","unstructured":"Arsham, H. (2007). A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs. Applied Mathematics and Computation, 188(1), 596\u2013611.","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"1769_CR17","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.amc.2004.10.078","volume":"170","author":"H Arsham","year":"2005","unstructured":"Arsham, H., Cimperman, G., Damij, N., Damij, T., & Grad, J. (2005). A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method. Applied Mathematics and Computation, 170(1), 36\u201363.","journal-title":"Applied Mathematics and Computation"},{"key":"1769_CR18","doi-asserted-by":"crossref","unstructured":"Arsham, H., & Kahn, A. (1989). A simplex-type algorithm for general transportation problems: An alternative to stepping-stone. Journal of the Operational Research Society, 40(6), 581\u2013590.","DOI":"10.1057\/jors.1989.95"},{"issue":"3","key":"1769_CR19","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/opre.33.3.527","volume":"33","author":"ML Balinski","year":"1985","unstructured":"Balinski, M. L. (1985). Signature methods for the assignment problem. Operations Research, 33(3), 527\u2013536.","journal-title":"Operations Research"},{"key":"1769_CR20","doi-asserted-by":"crossref","DOI":"10.1002\/9780471703778","volume-title":"Linear programming and network flows","author":"MS Bazaraa","year":"2009","unstructured":"Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (2009). Linear programming and network flows (4th ed.). Hoboken, NJ: Wiley.","edition":"4"},{"issue":"4","key":"1769_CR21","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1080\/10556780701223541","volume":"22","author":"F Bilen","year":"2007","unstructured":"Bilen, F., Csizmadia, Z., & Ill\u00e9s, T. (2007). Anstreicher\u2013Terlaky type monotonic simplex algorithms for linear feasibility problems. Optimization Methods and Software, 22(4), 679\u2013695.","journal-title":"Optimization Methods and Software"},{"issue":"2","key":"1769_CR22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"RG Bland","year":"1977","unstructured":"Bland, R. G. (1977). New finite pivoting rules for the simplex method. Mathematics of Operations Research, 2(2), 103\u2013107.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"1769_CR23","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01917108","volume":"26","author":"K Borgwardt","year":"1982","unstructured":"Borgwardt, K. (1982a). The average number of pivot steps required by the simplex-method is polynomial. Mathematical Methods of Operations Research, 26(1), 157\u2013177.","journal-title":"Mathematical Methods of Operations Research"},{"issue":"3","key":"1769_CR24","doi-asserted-by":"crossref","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 of the simplex method. Mathematics of Operations Research, 7(3), 441\u2013462.","journal-title":"Mathematics of Operations Research"},{"key":"1769_CR25","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment problems","author":"R Burkard","year":"2009","unstructured":"Burkard, R., Dell\u2019Amico, M., & Martello, S. (2009). Assignment problems. Philadephia, PA: Society for Industrial and Applied Mathematics."},{"issue":"5","key":"1769_CR26","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0167-6377(92)90094-J","volume":"12","author":"DM Cardoso","year":"1992","unstructured":"Cardoso, D. M., & Cl\u00edmaco, J. C. (1992). The generalized simplex method. Operations Research Letters, 12(5), 337\u2013348.","journal-title":"Operations Research Letters"},{"issue":"1","key":"1769_CR27","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/mnsc.1.1.49","volume":"1","author":"A Charnes","year":"1954","unstructured":"Charnes, A., & Cooper, W. W. (1954). The stepping stone method of explaining linear programming calculations in transportation problems. Management Science, 1(1), 49\u201369.","journal-title":"Management Science"},{"issue":"3","key":"1769_CR28","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0167-6377(94)90023-X","volume":"16","author":"HD Chen","year":"1994","unstructured":"Chen, H. D., Pardalos, P. M., & Saunders, M. A. (1994). The simplex algorithm with a new primal and dual pivot rule. Operations Research Letters, 16(3), 121\u2013127.","journal-title":"Operations Research Letters"},{"issue":"3","key":"1769_CR29","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/j.ejor.2011.11.013","volume":"219","author":"JJ Cochran","year":"2012","unstructured":"Cochran, J. J. (2012). You want them to remember? Then make it memorable! means for enhancing operations research education. European Journal of Operational Research, 219(3), 659\u2013670.","journal-title":"European Journal of Operational Research"},{"key":"1769_CR30","unstructured":"Csizmadia, Z. (2007). New pivot based methods in linear optimization, and an application in the petroleum industry. Ph.D. thesis, E\u00f6tv\u00f6s Lor\u00e1nd University of Sciences, Applied Mathematics."},{"issue":"2","key":"1769_CR31","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1080\/10556780500095009","volume":"21","author":"Z Csizmadia","year":"2006","unstructured":"Csizmadia, Z., & Ille\u015b, T. (2006). New criss-cross type algorithms for linear complementarity problems with sufficient matrices. Optimization Methods and Software, 21(2), 247\u2013266.","journal-title":"Optimization Methods and Software"},{"key":"1769_CR32","unstructured":"Csizmadia, Z., Bilen, F., & Ill\u00e9s, T. (2007). A new analysis for monotonic type simplex algorithms for feasibility problems. Alkalmazott Matematikai Lapok, 24(2), 163\u2013185."},{"issue":"3","key":"1769_CR33","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.ejor.2012.02.008","volume":"221","author":"Z Csizmadia","year":"2012","unstructured":"Csizmadia, Z., Ill\u00e9s, T., & Nagy, A. (2012). The s-monotone index selection rules for pivot algorithms of linear programming. European Journal of Operational Research, 221(3), 491\u2013500.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1769_CR34","first-page":"103","volume":"5","author":"Z Csizmadia","year":"2013","unstructured":"Csizmadia, Z., Ill\u00e9s, T., & Nagy, A. (2013). The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems. Acta Univ. Sapientiae, 5(1), 103\u2013139.","journal-title":"Acta Univ. Sapientiae"},{"issue":"4","key":"1769_CR35","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0167-6377(93)90045-I","volume":"13","author":"ND Curet","year":"1993","unstructured":"Curet, N. D. (1993). A primal-dual simplex method for linear programs. Operations Research Letters, 13(4), 233\u2013237.","journal-title":"Operations Research Letters"},{"key":"1769_CR36","unstructured":"Dantzig, G. B. (1948). Programming in a linear structure. Technical report, Comptroller, US Air Force, Washington, DC."},{"issue":"3\/4","key":"1769_CR37","doi-asserted-by":"crossref","first-page":"200","DOI":"10.2307\/1905523","volume":"17","author":"GB Dantzig","year":"1949","unstructured":"Dantzig, G. B. (1949). Programming of interdependent activities: II mathematical model. Econometrica, 17(3\/4), 200\u2013211.","journal-title":"Econometrica"},{"key":"1769_CR38","unstructured":"Dantzig, G. B. (1951). Application of the simplex method to a transportation problem. In T. C. Koopmans (Ed.), Activity analysis of production and allocation (pp 359\u2013373). New York: Wiley."},{"key":"1769_CR39","doi-asserted-by":"crossref","unstructured":"den Hertog, D., Roos, C., & Terlaky, T. (1993). The linear complimentarity problem, sufficient matrices, and the criss-cross method. Linear Algebra and Its Applications, 187, 1\u201314.","DOI":"10.1016\/0024-3795(93)90124-7"},{"issue":"1","key":"1769_CR40","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1287\/ited.7.1.106","volume":"7","author":"G Dobson","year":"2006","unstructured":"Dobson, G., & Shumsky, R. (2006). Web-based simulations for teaching queueing, little\u2019s law, and inventory management. INFORMS Transactions on Education, 7(1), 106\u2013123.","journal-title":"INFORMS Transactions on Education"},{"issue":"2","key":"1769_CR41","first-page":"137","volume":"4","author":"K Dosios","year":"1994","unstructured":"Dosios, K., & Paparrizos, K. (1994). A new exterior point algorithm for linear problems. Yugoslav Journal of Operations Research, 4(2), 137\u2013148.","journal-title":"Yugoslav Journal of Operations Research"},{"key":"1769_CR42","unstructured":"Dosios, K., Notopoulos, P., & Paparrizos, K. (1996a). Generalization of a signature method to transportation problems. Yugoslav Journal of Operations Research, 6(1), 55\u201371."},{"key":"1769_CR43","unstructured":"Dosios, K., Paparrizos, K., Samaras, N., & Tsiplidis, K. (1996b). Simplex type algorithms generating two paths to the optimal solution. In Proceedings of the 2nd Scandinavian workshop on linear programming, Copenhagen, Denmark (pp. 35\u201339)."},{"issue":"1","key":"1769_CR44","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-2217(91)90343-T","volume":"52","author":"K Fukuda","year":"1991","unstructured":"Fukuda, K., & Matsui, T. (1991). On the finiteness of the criss-cross method. European Journal of Operational Research, 52(1), 119\u2013124.","journal-title":"European Journal of Operational Research"},{"issue":"13","key":"1769_CR45","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0166-218X(97)00143-1","volume":"84","author":"K Fukuda","year":"1998","unstructured":"Fukuda, K., Namiki, M., & Tamura, A. (1998). EP theorems and linear complementarity problems. Discrete Applied Mathematics, 84(13), 107\u2013119.","journal-title":"Discrete Applied Mathematics"},{"issue":"1\u20133","key":"1769_CR46","first-page":"369","volume":"79","author":"K Fukuda","year":"1997","unstructured":"Fukuda, K., & Terlaky, T. (1997). Criss-cross methods: A fresh view on pivot algorithms. Mathematical Programming, 79(1\u20133), 369\u2013395.","journal-title":"Mathematical Programming"},{"issue":"4","key":"1769_CR47","first-page":"431","volume":"10","author":"K Fukuda","year":"1999","unstructured":"Fukuda, K., & Terlaky, T. (1999). On the existence of a short admissible pivot sequence for feasibility and linear optimization problems. Pure Mathematics and Applications, 10(4), 431\u2013447.","journal-title":"Pure Mathematics and Applications"},{"key":"1769_CR48","first-page":"10","volume":"13","author":"DM Gay","year":"1985","unstructured":"Gay, D. M. (1985). Electronic mail distribution of linear programming test problems. Mathematical Programming Society COAL Newsletter, 13, 10\u201312.","journal-title":"Mathematical Programming Society COAL Newsletter"},{"issue":"1","key":"1769_CR49","doi-asserted-by":"crossref","first-page":"157","DOI":"10.2298\/YJOR0901157G","volume":"19","author":"G Geranis","year":"2009","unstructured":"Geranis, G., Paparrizos, K., & Sifaleras, A. (2009). A dual exterior point simplex type algorithm for the minimum cost network flow problem. Yugoslav Journal of Operations Research, 19(1), 157\u2013170.","journal-title":"Yugoslav Journal of Operations Research"},{"issue":"3","key":"1769_CR50","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1051\/ro\/2012015","volume":"46","author":"G Geranis","year":"2012","unstructured":"Geranis, G., Paparrizos, K., & Sifaleras, A. (2012). On a dual network exterior point simplex type algorithm and its computational behavior. RAIRO - Operations Research, 46(3), 211\u2013234.","journal-title":"RAIRO - Operations Research"},{"key":"1769_CR51","unstructured":"Glavelis, T., Samaras, N., & Paparrizos, K. (2011) An experimental investigation of a primal-dual exterior point simplex algorithm. In Proceedings of the 1st international symposium and 10th Balkan conference on operational research (BALCOR 2011), Thessaloniki, Greece (Vol. 2, pp. 240\u2013247)."},{"key":"1769_CR52","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/BFb0121086","volume-title":"Netflow at Pisa, mathematical programming studies","author":"F Glover","year":"1986","unstructured":"Glover, F., Glover, R., & Klingman, D. (1986). Threshold assignment algorithm. In G. Gallo & C. Sandi (Eds.), Netflow at Pisa, mathematical programming studies (Vol. 26, pp. 12\u201337). Berlin: Springer."},{"issue":"1","key":"1769_CR53","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/opre.20.1.126","volume":"20","author":"F Glover","year":"1972","unstructured":"Glover, F., Klingman, D., & Napier, A. (1972). Basic dual feasible solutions for a class of generalized networks. Operations Research, 20(1), 126\u2013136.","journal-title":"Operations Research"},{"issue":"2","key":"1769_CR54","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01582245","volume":"33","author":"D Goldfarb","year":"1985","unstructured":"Goldfarb, D. (1985). Efficient dual simplex algorithms for the assignment problem. Mathematical Programming, 33(2), 187\u2013203.","journal-title":"Mathematical Programming"},{"issue":"3","key":"1769_CR55","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01580869","volume":"47","author":"D Goldfarb","year":"1990","unstructured":"Goldfarb, D., & Hao, J. (1990). A primal simplex algorithm that solves the maximum flow problem in at most $$nm$$ n m pivots and $${O}(n^2 m)$$ O ( n 2 m ) time. Mathematical Programming, 47(3), 353\u2013365.","journal-title":"Mathematical Programming"},{"issue":"4","key":"1769_CR56","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1287\/opre.38.4.624","volume":"38","author":"D Goldfarb","year":"1990","unstructured":"Goldfarb, D., Hao, J., & Kai, S. R. (1990). Efficient shortest path simplex algorithms. Operations Research, 38(4), 624\u2013628.","journal-title":"Operations Research"},{"issue":"4","key":"1769_CR57","first-page":"739","volume":"25","author":"J Gondzio","year":"1996","unstructured":"Gondzio, J. (1996). Another simplex-type method for large scale linear programming. Control and Cybernetics, 25(4), 739\u2013760.","journal-title":"Control and Cybernetics"},{"issue":"1","key":"1769_CR58","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1002\/cae.20450","volume":"21","author":"G Gregoriou","year":"2013","unstructured":"Gregoriou, G., Kirytopoulos, K., & Kiriklidis, C. (2013). Project management educational software (ProMES). Computer Applications in Engineering Education, 21(1), 46\u201359.","journal-title":"Computer Applications in Engineering Education"},{"key":"1769_CR59","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1080\/10556780902752785","volume":"24","author":"P Guerrero-Garcia","year":"2009","unstructured":"Guerrero-Garcia, P., & Santos-Palomo, A. (2009). A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides\u2019 primal-dual simplex-type algorithm. Optimization Methods Software, 24, 187\u2013204.","journal-title":"Optimization Methods Software"},{"issue":"2","key":"1769_CR60","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/opre.24.2.301","volume":"24","author":"J Hultz","year":"1976","unstructured":"Hultz, J., Klingman, D., & Russell, R. (1976). Advanced dual basic feasible solution for a class of capacitated generalized networks. Operations Research, 24(2), 301\u2013313.","journal-title":"Operations Research"},{"issue":"3","key":"1769_CR61","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.31.3.595","volume":"31","author":"MS Hung","year":"1983","unstructured":"Hung, M. S. (1983). A polynomial simplex method for the assignment problem. Operations Research, 31(3), 595\u2013600.","journal-title":"Operations Research"},{"issue":"1","key":"1769_CR62","first-page":"15","volume":"11","author":"T Ille\u015b","year":"2001","unstructured":"Ille\u015b, T., & M\u00e8sz\u00earos, K. (2001). A new and constructive proof of two basic results of linear programming. Yugoslav Journal of Operations Research, 11(1), 15\u201330.","journal-title":"Yugoslav Journal of Operations Research"},{"issue":"1","key":"1769_CR63","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1080\/02331934.2013.800515","volume":"63","author":"T Ill\u00e9s","year":"2013","unstructured":"Ill\u00e9s, T., & Moln\u00e1r-Szipai, R. (2013). On strongly polynomial variants of the MBU-simplex algorithm for a maximum flow problem with non-zero lower bounds. Optimization, 63(1), 39\u201347.","journal-title":"Optimization"},{"key":"1769_CR64","doi-asserted-by":"crossref","unstructured":"Ill\u00e9s, T., & Nagy, A. (2014a). Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules. Optimization, 63(1), 49\u201366.","DOI":"10.1080\/02331934.2013.811666"},{"key":"1769_CR65","unstructured":"Ill\u00e9s, T., & Nagy, A. (2014b). Finiteness of the quadratic primal simplex method when s-monotone index selection rules are applied. Technical Report 2014\u201301, Department of Operations Research, E\u00f6tv\u00f6s Lor\u00e1nd University of Sciences, Budapest, Hungary."},{"key":"1769_CR66","doi-asserted-by":"crossref","unstructured":"Ill\u00e9s, T., Szirmai, A., & Terlaky, T. (1999). The finite criss-cross method for hyperbolic programming. European Journal of Operational Research, 114(1), 198\u2013214.","DOI":"10.1016\/S0377-2217(98)00049-6"},{"issue":"2","key":"1769_CR67","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/S0377-2217(02)00061-9","volume":"140","author":"T Ille\u015b","year":"2002","unstructured":"Ille\u015b, T., & Terlaky, T. (2002). Pivot versus interior point methods: Pros and cons. European Journal of Operational Research, 140(2), 170\u2013190.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1769_CR68","first-page":"129","volume":"4","author":"T Jur\u00edk","year":"2008","unstructured":"Jur\u00edk, T. (2008). A nearest point approach algorithm for a class of linear programming problems. Journal of Applied Mathematics, Statistics and Informatics, 4(2), 129\u2013138.","journal-title":"Journal of Applied Mathematics, Statistics and Informatics"},{"issue":"7","key":"1769_CR69","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1080\/00207390600723551","volume":"37","author":"P Karagiannis","year":"2006","unstructured":"Karagiannis, P., Markelis, I., Paparrizos, K., Samaras, N., & Sifaleras, A. (2006). E-learning technologies: Employing matlab web server to facilitate the education of mathematical programming. International Journal of Mathematical Education in Science and Technology, 37(7), 765\u2013782.","journal-title":"International Journal of Mathematical Education in Science and Technology"},{"issue":"4","key":"1769_CR70","doi-asserted-by":"crossref","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":"1769_CR71","first-page":"191","volume":"20","author":"LG Khachian","year":"1979","unstructured":"Khachian, L. G. (1979). A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20, 191\u2013194.","journal-title":"Soviet Mathematics Doklady"},{"key":"1769_CR72","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0024-3795(91)90356-2","volume":"151","author":"E Klafszky","year":"1991","unstructured":"Klafszky, E., & Terlaky, T. (1991). The role of pivoting in proving some fundamental theorems of linear algebra. Linear Algebra and Its Applications, 151, 97\u2013118.","journal-title":"Linear Algebra and Its Applications"},{"issue":"1\u20132","key":"1769_CR73","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1080\/02331939208843783","volume":"24","author":"E Klafszky","year":"1992","unstructured":"Klafszky, E., & Terlaky, T. (1992). Some generalizations of the criss-cross method for quadratic programming. Optimization, 24(1\u20132), 127\u2013139.","journal-title":"Optimization"},{"key":"1769_CR74","first-page":"159","volume-title":"Inequalities","author":"V Klee","year":"1972","unstructured":"Klee, V., & Minty, G. J. (1972). How good is the simplex algorithm? In O. Shisha (Ed.), Inequalities (Vol. III, pp. 159\u2013175). New York: Academic Press."},{"issue":"2","key":"1769_CR75","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R. E., et al. (2011). MIPLIB 2010. Mathematical Programming Computation, 3(2), 103\u2013163.","journal-title":"Mathematical Programming Computation"},{"issue":"1","key":"1769_CR76","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/cae.20084","volume":"15","author":"V Lazaridis","year":"2007","unstructured":"Lazaridis, V., Paparrizos, K., Samaras, N., & Sifaleras, A. (2007). Visual linprog: A web-based educational software for linear programming. Computer Applications in Engineering Education, 15(1), 1\u201314.","journal-title":"Computer Applications in Engineering Education"},{"issue":"1","key":"1769_CR77","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1287\/ited.7.1.37","volume":"7","author":"J Lee","year":"2006","unstructured":"Lee, J., & Raffensperger, J. (2006). Using AMPL for teaching the TSP. INFORMS Transactions on Education, 7(1), 37\u201369.","journal-title":"INFORMS Transactions on Education"},{"key":"1769_CR78","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-3-642-13278-0_29","volume-title":"Advances in Neural Networks - ISNN 2010, Lecture Notes in Computer Science","author":"W Li","year":"2010","unstructured":"Li, W. (2010). Practical criss-cross method for linear programming. In L. Zhang, B. L. Lu, & J. Kwok (Eds.), Advances in Neural Networks - ISNN 2010, Lecture Notes in Computer Science (Vol. 6063, pp. 223\u2013229). Berlin: Springer."},{"key":"1769_CR79","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1016\/j.camwa.2005.11.033","volume":"51","author":"W Li","year":"2006","unstructured":"Li, W., Guerrero-Garc\u00eda, P., & Santos-Palomo, A. (2006). A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule. Computers & Mathematics with Applications, 51, 903\u2013914.","journal-title":"Computers & Mathematics with Applications"},{"issue":"7","key":"1769_CR80","doi-asserted-by":"crossref","first-page":"1903","DOI":"10.1016\/j.amc.2010.01.113","volume":"216","author":"B Malakooti","year":"2010","unstructured":"Malakooti, B., & Al-Najjar, C. (2010). The complex interior-boundary method for linear and nonlinear programming with linear constraints. Applied Mathematics and Computation, 216(7), 1903\u20131917.","journal-title":"Applied Mathematics and Computation"},{"key":"1769_CR81","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0257-9","volume-title":"Computational techniques of the simplex method","author":"I Maros","year":"2003","unstructured":"Maros, I. (2003). Computational techniques of the simplex method (Vol. 61). Massachusetts: Springer."},{"key":"1769_CR82","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1145\/53580.214953","volume":"31","author":"G Mitra","year":"1988","unstructured":"Mitra, G., Tamiz, M., & Yadegar, J. (1988). Experimental investigation of an interior search method within a simplex framework. Communications of the ACM, 31, 1474\u20131482.","journal-title":"Communications of the ACM"},{"issue":"3","key":"1769_CR83","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0167-6377(84)90003-8","volume":"3","author":"K Murty","year":"1984","unstructured":"Murty, K., & Fathi, Y. (1984). A feasible direction method for linear programming. Operations Research Letters, 3(3), 121\u2013127.","journal-title":"Operations Research Letters"},{"issue":"2","key":"1769_CR84","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"JB Orlin","year":"1993","unstructured":"Orlin, J. B. (1993). A faster strongly polynomial minimum cost flow algorithm. Operations Research, 41(2), 338\u2013350.","journal-title":"Operations Research"},{"issue":"2","key":"1769_CR85","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02614365","volume":"78","author":"JB Orlin","year":"1997","unstructured":"Orlin, J. B. (1997). A polynomial time primal network simplex algorithm for minimum cost flows. Mathematical Programming, 78(2), 109\u2013129.","journal-title":"Mathematical Programming"},{"issue":"1\u20133","key":"1769_CR86","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01580615","volume":"60","author":"JB Orlin","year":"1993","unstructured":"Orlin, J. B., Plotkin, S. A., & Tardos, \u00c9. (1993). Polynomial dual network simplex algorithms. Mathematical programming, 60(1\u20133), 255\u2013276.","journal-title":"Mathematical programming"},{"issue":"2","key":"1769_CR87","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.ejor.2007.03.026","volume":"187","author":"PQ Pan","year":"2008","unstructured":"Pan, P. Q. (2008). A largest-distance pivot rule for the simplex algorithm. European Journal of Operational Research, 187(2), 393\u2013402.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"1769_CR88","doi-asserted-by":"crossref","first-page":"837","DOI":"10.4208\/jcm.3105-m2897","volume":"28","author":"PQ Pan","year":"2010","unstructured":"Pan, P. Q. (2010). A fast algorithm for linear programming. Journal of Computational Mathematics, 28(6), 837\u2013847.","journal-title":"Journal of Computational Mathematics"},{"issue":"2","key":"1769_CR89","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.amc.2003.09.028","volume":"158","author":"C Papamanthou","year":"2004","unstructured":"Papamanthou, C., Paparrizos, K., & Samaras, N. (2004). Computational experience with exterior point algorithms for the transportation problem. Applied Mathematics and Computation, 158(2), 459\u2013475.","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"1769_CR90","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2298\/YJOR0501147P","volume":"15","author":"C Papamanthou","year":"2005","unstructured":"Papamanthou, C., Paparrizos, K., & Samaras, N. (2005). A parametric visualization software for the assignment problem. Yugoslav Journal of Operations Research, 15(1), 1\u201312.","journal-title":"Yugoslav Journal of Operations Research"},{"issue":"8","key":"1769_CR91","doi-asserted-by":"crossref","first-page":"1831","DOI":"10.1080\/00207160802524739","volume":"87","author":"C Papamanthou","year":"2010","unstructured":"Papamanthou, C., Paparrizos, K., Samaras, N., & Sifaleras, A. (2010). On the initialization methods of an exterior point algorithm for the assignment problem. International Journal of Computer Mathematics, 87(8), 1831\u20131846.","journal-title":"International Journal of Computer Mathematics"},{"issue":"3","key":"1769_CR92","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/j.disopt.2007.12.003","volume":"5","author":"C Papamanthou","year":"2008","unstructured":"Papamanthou, C., Paparrizos, K., Samaras, N., & Stergiou, K. (2008). Worst case examples of an exterior point algorithm for the assignment problem. Discrete Optimization, 5(3), 605\u2013614.","journal-title":"Discrete Optimization"},{"issue":"3","key":"1769_CR93","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1051\/ro\/1988220302691","volume":"22","author":"K Paparrizos","year":"1988","unstructured":"Paparrizos, K. (1988). A non-dual signature method for the assignment problem and a generalization of the dual simplex-method for the transportation problem. RAIRO, 22(3), 269\u2013289.","journal-title":"RAIRO"},{"key":"1769_CR94","doi-asserted-by":"crossref","unstructured":"Paparrizos, K. (1991a). An infeasible (exterior point) simplex algorithm for assignment problems. Mathematical Programming, 51(1), 45\u201354.","DOI":"10.1007\/BF01586925"},{"key":"1769_CR95","doi-asserted-by":"crossref","unstructured":"Paparrizos, K. (1991b). A relaxation column signature method for assignment problems. European Journal of Operational Research, 50(2), 211\u2013219.","DOI":"10.1016\/0377-2217(91)90243-O"},{"issue":"2","key":"1769_CR96","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/BF02023111","volume":"46\u201347","author":"K Paparrizos","year":"1993","unstructured":"Paparrizos, K. (1993). An exterior point simplex algorithm for (general) linear programming problems. Annals of Operations Research, 46\u201347(2), 497\u2013508.","journal-title":"Annals of Operations Research"},{"key":"1769_CR97","unstructured":"Paparrizos, K. (1996a). A new primal and dual pivoting rule for the simplex algorithm. In Proceedings of the SYMOPIS\u2019 96, Zlatibor (pp. 448\u2013453)."},{"key":"1769_CR98","doi-asserted-by":"crossref","unstructured":"Paparrizos, K. (1996b). A non improving simplex algorithm for transportation problems. RAIRO, 30(1), 1\u201315.","DOI":"10.1051\/ro\/1996300100011"},{"key":"1769_CR99","unstructured":"Paparrizos, K. (1997). Pivoting algorithms generating two paths. In: International symposium on mathematical programming (ISMP\u2019 97), (p. 207); (book of abstracts). Laussane: EPFL Switzerland."},{"key":"1769_CR100","doi-asserted-by":"crossref","unstructured":"Paparrizos, K., Samaras, N., & Sifaleras, A. (2009a). A new exterior simplex type algorithm for the minimum cost network flow problem. Computers & Operations Research, 36(4), 1176\u20131190.","DOI":"10.1016\/j.cor.2008.01.001"},{"key":"1769_CR101","doi-asserted-by":"crossref","unstructured":"Paparrizos, K., Samaras, N., & Tsiplidis, K. (2009b). Pivoting algorithms for linear programming generating two paths. In C. A. Floudas & P. M. Pardalos (Eds.), Encyclopedia of optimization (2nd ed., pp. 2965\u20132969). New York: Springer.","DOI":"10.1007\/978-0-387-74759-0_509"},{"key":"1769_CR102","doi-asserted-by":"crossref","unstructured":"Paparrizos, K., Samaras, N., & Stephanides, G. (2003a). An efficient simplex type algorithm for sparse and dense linear programs. European Journal of Operational Research, 148(2), 323\u2013334.","DOI":"10.1016\/S0377-2217(02)00400-9"},{"key":"1769_CR103","doi-asserted-by":"crossref","unstructured":"Paparrizos, K., Samaras, N., & Stephanides, G. (2003b). A new efficient primal dual simplex algorithm. Computers & Operations Research, 30(9), 1383\u20131399.","DOI":"10.1016\/S0305-0548(02)00077-1"},{"key":"1769_CR104","unstructured":"Paparrizos, K., Samaras, N., & Triantafyllidis, C. (2008). A computational study of exterior point simplex algorithm variations. In: Proceedings of 20th Hellenic Operational Research Society, Spetses, Greece (pp. 777\u2013785)."},{"key":"1769_CR105","unstructured":"Paparrizos, K., Samaras, N., & Tsiplidis, K. (1995). Some results on the finiteness of an exterior point simplex algorithm. In: Proceedings of the 3rd Balkan Conference on Operations Research, Thessaloniki, Greece (Vol. 1, pp. 402\u2013414)."},{"key":"1769_CR106","volume-title":"Network models in optimization and their applications in practice","author":"NV Phillips","year":"1992","unstructured":"Phillips, N. V., Glover, F., & Klingman, D. (1992). Network models in optimization and their applications in practice. New York: Wiley."},{"key":"1769_CR107","doi-asserted-by":"crossref","unstructured":"Ploskas, N., & Samaras, N. (2015). Efficient GPU-based implementations of simplex type algorithms. Applied Mathematics and Computation, 250, 552\u2013570.","DOI":"10.1016\/j.amc.2014.10.096"},{"key":"1769_CR108","unstructured":"Ploskas, N., Samaras, N., & Sifaleras, A. (2009). A parallel implementation of an exterior point algorithm for linear programming problems. In: Proceedings of the 9th Balkan conference on operational research (BALCOR 2009), Constanta, Romania."},{"issue":"5","key":"1769_CR109","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1137\/S1064827593258280","volume":"17","author":"L Portugal","year":"1996","unstructured":"Portugal, L., Bastos, F., J\u00fadice, J., Paix\u00e3o, J., & Terlaky, T. (1996). An investigation of interior-point algorithms for the linear transportation problem. SIAM Journal on Scientific Computing, 17(5), 1202\u20131223.","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"4","key":"1769_CR110","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G. (1991). TSPLIB: A traveling salesman problem library. INFORMS Journal on Computing, 3(4), 376\u2013384.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"1769_CR111","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01585729","volume":"46","author":"C Roos","year":"1990","unstructured":"Roos, C. (1990). An exponential example for Terlaky\u2019s pivoting rule for the criss-cross simplex method. Mathematical Programming, 46(1), 79\u201384.","journal-title":"Mathematical Programming"},{"issue":"1","key":"1769_CR112","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1287\/opre.17.1.187","volume":"17","author":"EJ Russell","year":"1969","unstructured":"Russell, E. J. (1969). Letters to the editor: Extension of Dantzig\u2019s algorithm to finding an initial near-optimal basis for the transportation problem. Operations Research, 17(1), 187\u2013191.","journal-title":"Operations Research"},{"key":"1769_CR113","unstructured":"Samaras, N. (2001). Computational improvements and efficient implementation of two path pivoting algorithms. Ph.D. thesis, Dept. of Applied Informatics, University of Macedonia."},{"key":"1769_CR114","unstructured":"Samaras, N., & Sifaleras, A. (2007). A comparative computational study of exterior point algorithms for the assignment problem. In: Proceedings of 19th national conference of Hellenic Operational Research Society (HELORS), Arta, Greece."},{"issue":"1","key":"1769_CR115","doi-asserted-by":"crossref","first-page":"123","DOI":"10.2298\/YJOR0901123S","volume":"19","author":"N Samaras","year":"2009","unstructured":"Samaras, N., Sifaleras, A., & Triantafyllidis, C. (2009). A primal\u2013dual exterior point algorithm for linear programming problems. Yugoslav Journal of Operations Research, 19(1), 123\u2013132.","journal-title":"Yugoslav Journal of Operations Research"},{"key":"1769_CR116","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1016\/S0305-0548(00)00025-3","volume":"28","author":"HD Sherali","year":"2001","unstructured":"Sherali, H. D., \u00d6zdaryal, B., Adams, W. P., & Attia, N. (2001). On using exterior penalty approaches for solving linear programming problems. Computers and Operations Research, 28, 1049\u20131074.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"1769_CR117","doi-asserted-by":"crossref","first-page":"3","DOI":"10.2298\/YJOR121120001S","volume":"23","author":"A Sifaleras","year":"2013","unstructured":"Sifaleras, A. (2013). Minimum cost network flows: Problems, algorithms, and software. Yugoslav Journal of Operations Research, 23(1), 3\u201317.","journal-title":"Yugoslav Journal of Operations Research"},{"issue":"5","key":"1769_CR118","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1080\/02331938508843067","volume":"16","author":"T Terlaky","year":"1985","unstructured":"Terlaky, T. (1985). A convergent criss-cross method. Optimization, 16(5), 683\u2013690.","journal-title":"Optimization"},{"issue":"1","key":"1769_CR119","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02096264","volume":"46","author":"T Terlaky","year":"1993","unstructured":"Terlaky, T., & Zhang, S. (1993). Pivot rules for linear programming: A survey on recent theoretical developments. Annals of Operations Research, 46(1), 203\u2013233.","journal-title":"Annals of Operations Research"},{"key":"1769_CR120","unstructured":"Triantafyllidis, C., & Samaras, N. (2014). Three nearly scaling invariant versions of an exterior point algorithm for linear programming. Optimization: A Journal of Mathematical Programming and Operations Research. To appear."},{"issue":"4","key":"1769_CR121","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1080\/02331939208843835","volume":"25","author":"H V\u00e4liaho","year":"1992","unstructured":"V\u00e4liaho, H. (1992). A new proof for the criss-cross method for quadratic programming. Optimization, 25(4), 391\u2013400.","journal-title":"Optimization"},{"issue":"1","key":"1769_CR122","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s001860200202","volume":"56","author":"J Vygen","year":"2002","unstructured":"Vygen, J. (2002). On dual minimum cost flow algorithms. Mathematical Methods of Operations Research, 56(1), 101\u2013126.","journal-title":"Mathematical Methods of Operations Research"},{"key":"1769_CR123","doi-asserted-by":"crossref","unstructured":"Wolfe, P. (1959). The simplex method for quadratic programming. Econometrica: Journal of the Econometric Society, 27, 382\u2013398.","DOI":"10.2307\/1909468"},{"issue":"1","key":"1769_CR124","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.amc.2009.03.080","volume":"214","author":"WC Yeh","year":"2009","unstructured":"Yeh, W. C., & Corley, H. (2009). A simple direct cosine simplex algorithm. Applied Mathematics and Computation, 214(1), 178\u2013186.","journal-title":"Applied Mathematics and Computation"},{"issue":"3","key":"1769_CR125","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0377-2217(98)00026-5","volume":"116","author":"S Zhang","year":"1999","unstructured":"Zhang, S. (1999). New variants of finite criss-cross pivot algorithms for linear programming. European Journal of Operational Research, 116(3), 607\u2013614.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"1769_CR126","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/mnsc.15.7.426","volume":"15","author":"S Zionts","year":"1969","unstructured":"Zionts, S. (1969). The criss-cross method for solving linear programming problems. Management Science, 15(7), 426\u2013445.","journal-title":"Management Science"},{"issue":"4\u2013Part\u20131","key":"1769_CR127","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1287\/mnsc.19.4.406","volume":"19","author":"S Zionts","year":"1972","unstructured":"Zionts, S. (1972). Some empirical tests of the criss-cross method. Management Science, 19(4\u2013Part\u20131), 406\u2013410.","journal-title":"Management Science"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1769-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1769-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1769-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:25:04Z","timestamp":1566170704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1769-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,1]]},"references-count":127,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["1769"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1769-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,1]]}}}