{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T23:54:02Z","timestamp":1769126042879,"version":"3.49.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319240237","type":"print"},{"value":"9783319240244","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24024-4_17","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T12:00:10Z","timestamp":1441368010000},"page":"281-307","source":"Crossref","is-referenced-by-count":8,"title":["Advances in the Parallelization of the Simplex Method"],"prefix":"10.1007","author":[{"given":"Basilis","family":"Mamalis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grammati","family":"Pantziou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,22]]},"reference":[{"key":"17_CR1","volume-title":"Linear Programming","author":"K Murty","year":"1983","unstructured":"Murty, K.: Linear Programming. Wiley, New York (1983)"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10287-008-0080-5","volume":"7","author":"JA Hall","year":"2010","unstructured":"Hall, J.A.: Towards a practical parallelization of the simplex method. Comput. Manag. Sci. 7(2), 139\u2013170 (2010)","journal-title":"Comput. Manag. Sci."},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s11227-008-0253-6","volume":"49","author":"G Yarmish","year":"2009","unstructured":"Yarmish, G., Slyke, R.V.: A distributed scaleable simplex method. J. Supercomput. 49(3), 373\u2013381 (2009)","journal-title":"J. Supercomput."},{"key":"17_CR4","unstructured":"Badr, E.S., Moussa, M., Paparrizos, K., Samaras, N., Sifaleras, A.: Some Computational Results on MPI Parallel Implementation of Dense Simplex Method. World Academy of Science, Engineering and Technology (WASET), vol. 23, pp. 778\u2013781 (2008)"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/BF01197042","volume":"11","author":"J Qin","year":"1996","unstructured":"Qin, J., Nguyen, D.T.: A parallel-vector simplex algorithm on distributed-memory computers. Struct. Optim. 11(3), 260\u2013262 (1996)","journal-title":"Struct. Optim."},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-31464-3_15","volume-title":"Parallel Processing and Applied Mathematics","author":"J Hall","year":"2012","unstructured":"Hall, J., Huangfu, Q.: A high performance dual revised simplex solver. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wa\u015bniewski, J. (eds.) PPAM 2011, Part I. LNCS, vol. 7203, pp. 143\u2013151. Springer, Heidelberg (2012)"},{"key":"17_CR7","unstructured":"Huangfu, Q., Hall, J.A.: Parallelizing the dual revised simplex method. Technical report ERGO-14-011 (2014). http:\/\/www.maths.ed.ac.uk\/hall\/Publications.html"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10589-013-9542-y","volume":"55","author":"M Lubin","year":"2013","unstructured":"Lubin, M., Hall, J.A., Petra, C.G., Anitescu, M.: Parallel distributed-memory simplex for large-scale stochastic LP problems. Comput. Optim. Appl. 55(3), 571\u2013596 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1018957107705","volume":"81","author":"JA Hall","year":"1998","unstructured":"Hall, J.A., McKinnon, K.: ASYNPLEX an asynchronous parallel revised simplex algorithm. Ann. Oper. Res. 81, 27\u201349 (1998)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"2540","DOI":"10.1006\/jpdc.1995.1142","volume":"31","author":"W Shu","year":"1995","unstructured":"Shu, W.: Parallel implementation of a sparse simplex algorithm on MIMD distributed memory computers. J. Parallel Distrib. Comput. 31(1), 2540 (1995)","journal-title":"J. Parallel Distrib. Comput."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Thomadakis M.E., Liu, J.C.: An efficient steepest-edge simplex algorithm for SIMD computers. In: Proceedings of the International Conference on Supercomputing (ICS 96), Philadelphia, pp. 286\u2013293 (1996)","DOI":"10.1145\/237578.237620"},{"issue":"4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1287\/ijoc.7.4.402","volume":"7","author":"J Eckstein","year":"1995","unstructured":"Eckstein, J., Boduroglu, I., Polymenakos, L., Goldfarb, D.: Data-parallel implementations of dense simplex methods on the connection machine CM-2. ORSA J. Comput. 7(4), 402\u2013416 (1995)","journal-title":"ORSA J. Comput."},{"key":"17_CR13","unstructured":"Stunkel, C.B.: Linear optimization via message-based parallel processing. In: Proceedings of International Conference on Parallel Processing (ICPP), Pennsylvania, pp. 264\u2013271 (1988)"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0167-6377(00)00017-1","volume":"27","author":"D Klabjan","year":"2000","unstructured":"Klabjan, D., Johnson, L.E., Nemhauser, L.G.: A parallel primal-dual simplex algorithm. Oper. Res. Lett. 27(2), 47\u201355 (2000)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0167-8191(99)00100-3","volume":"26","author":"I Maros","year":"2000","unstructured":"Maros, I., Mitra, G.: Investigating the sparse simplex method on a distributed memory multiprocessor. Parallel Comput. 26(1), 151\u2013170 (2000)","journal-title":"Parallel Comput."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Mamalis, B., Pantziou, G., Dimitropoulos, G., Kremmydas, D.: Reexamining the parallelization schemes for standard full tableau simplex method on distributed memory environments. In: Proceedings of the 10th IASTED PDCN (Parallel and Distributed Computing and Networks) Conference, Innsbruck, Austria, pp. 115\u2013123 (2011)","DOI":"10.2316\/P.2011.719-028"},{"issue":"4","key":"17_CR17","first-page":"152","volume":"35","author":"B Mamalis","year":"2013","unstructured":"Mamalis, B., Pantziou, G., Dimitropoulos, G., Kremmydas, D.: Highly scalable parallelization of standard simplex method on a myrinet connected cluster platform. ACTA Intl. J. Comput. Appl. 35(4), 152\u2013161 (2013)","journal-title":"ACTA Intl. J. Comput. Appl."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Mamalis, B., Perlitis, M.: Hybrid parallelization of standard full tableau simplex method with MPI and OpenMP. In: Proceedings of the 18th Panhellenic Conference in Informatics (PCI 2014), ACM ICPS, October 2\u20134, Athens, Greece, pp. 1\u20136 (2014)","DOI":"10.1145\/2645791.2645802"},{"key":"17_CR19","first-page":"21","volume-title":"The Characteristics of Parallel Algorithms","author":"RA Finkel","year":"1987","unstructured":"Finkel, R.A.: Large-grain parallelism: three case studies. In: Jamieson, L.H., Gannon, D., Douglas, R.J. (eds.) The Characteristics of Parallel Algorithms, pp. 21\u201363. MIT Press, Cambridge (1987)"},{"key":"17_CR20","unstructured":"Boffey, T.B., Hay, R.: Implementing parallel simplex algorithms. In: CONPAR 88, p. 169176. Cambridge University Press, Cambridge (1989)"},{"issue":"1","key":"17_CR21","first-page":"8695","volume":"31","author":"DA Babaev","year":"1991","unstructured":"Babaev, D.A., Mardanov, S.S.: A parallel algorithm for solving linear programming problems. ZhVychislitelnoi Matematiki Matematicheskoi Fiziki 31(1), 8695 (1991)","journal-title":"ZhVychislitelnoi Matematiki Matematicheskoi Fiziki"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Agrawal, A., Blelloch, G.E., Krawitz, R.L., Phillips, C.A.: Four vectormatrix primitives. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 292\u2013302 (1989)","DOI":"10.21236\/ADA211889"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"1938","DOI":"10.1007\/BF00127844","volume":"5","author":"Z Cvetanovic","year":"1991","unstructured":"Cvetanovic, Z., Freedman, E.G., Nofsinger, C.: Efficient decomposition and performance of parallel PDE, FFT, Monte-Carlo simulations, simplex, and sparse solvers. J. Supercomput. 5, 1938 (1991)","journal-title":"J. Supercomput."},{"key":"17_CR24","series-title":"IFIP Transactions A (Computer Science and Technology)","first-page":"525","volume-title":"Algorithms, Software, Architecture","author":"J Luo","year":"1992","unstructured":"Luo, J., Reijns, G.L.: Linear programming on transputers. In: van Leeuwen, J. (ed.) Algorithms, Software, Architecture. IFIP Transactions A (Computer Science and Technology), pp. 525\u2013534. Elsevier, Amsterdam (1992)"},{"key":"17_CR25","unstructured":"Boduroglu, I.: Scalable massively parallel simplex algorithms for block-structured linear programs. Ph.D. thesis, GSAS, Columbia University, New York (1997)"},{"key":"17_CR26","unstructured":"Pfefferkorn, C.E., Tomlin, J.A.: Design of a linear programming system for the ILLIAC IV. Technical report SOL 76\u20138. Systems Optimization Laboratory, Stanford University (1976)"},{"key":"17_CR27","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1007\/BF02186472","volume":"14","author":"RV Helgason","year":"1988","unstructured":"Helgason, R.V., Kennington, L.J., Zaki, H.A.: A parallelisation of the simplex method. Ann. Oper. Res. 14, 1740 (1988)","journal-title":"Ann. Oper. Res."},{"key":"17_CR28","unstructured":"McKinnon, K., Plab, F.: An upper bound on parallelism in the forward transfor-mation within the revised simplex method. Technical report, Department of Mathematics and Statistics, University of Edinburgh (1997)"},{"issue":"4","key":"17_CR29","doi-asserted-by":"publisher","first-page":"349363","DOI":"10.1007\/BF01299209","volume":"3","author":"JK Ho","year":"1994","unstructured":"Ho, J.K., Sundarraj, R.P.: On the efficacy of distributed simplex algorithms for linear programming. Comput. Optim. Appl. 3(4), 349363 (1994)","journal-title":"Comput. Optim. Appl."},{"key":"17_CR30","doi-asserted-by":"publisher","first-page":"4556","DOI":"10.1287\/ijoc.12.1.45.11902","volume":"12","author":"RE Bixby","year":"2000","unstructured":"Bixby, R.E., Martin, A.: Parallelizing the dual simplex method. INFORMS J. Comput. 12, 4556 (2000)","journal-title":"INFORMS J. Comput."},{"key":"17_CR31","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/BFb0120714","volume":"4","author":"R Rosander","year":"1975","unstructured":"Rosander, R.: Multiple pricing and suboptimization in dual linear programming algorithms. Math. Program. Study 4, 108\u2013117 (1975)","journal-title":"Math. Program. Study"},{"key":"17_CR32","unstructured":"Mittelmann, H.: Benchmarks for optimization software (2014). http:\/\/plato.la.asu.edu\/bench.html . Accessed 30 July 2014"},{"key":"17_CR33","series-title":"Springer Series in Operations Research and Financial Engineering","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"J Birge","year":"2011","unstructured":"Birge, J., Louveaux, F.: Introduction to Stochastic Programming. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, New York (2011)","edition":"2"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Spampinato, D.G., Elster, A.C.: Linear optimization on modern GPUs. In: Proceedings of the 23rd IEEE IPDPS09 Conference, Rome, Italy (2009)","DOI":"10.1109\/IPDPS.2009.5161106"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Bieling, J., Peschlow, P., Martini, P.: An efficient GPU implementation of the revised simplex method. In: Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium, (IPDPS 2010), Atlanta (2010)","DOI":"10.1109\/IPDPSW.2010.5470831"},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Lalami, M.E., Boyer, V., El-Baz, D.: Efficient Implementation of the simplex method on a CPU-GPU system. In: IEEE International Parallel and Distributed Processing Symposium, pp. 1994\u20132001 (2011)","DOI":"10.1109\/IPDPS.2011.362"},{"key":"17_CR37","doi-asserted-by":"crossref","unstructured":"Lalami, M.E., El-Baz, D., Boyer, V.: Multi GPU implementation of the simplex algorithm. In: Proceedings of the 2011 IEEE 13th International Conference on High Performance Computing and Communications (HPCC), Banff, pp. 179\u2013186 (2011)","DOI":"10.1109\/HPCC.2011.32"},{"key":"17_CR38","unstructured":"Meyer, X., Albuquerque, P., Chopard, B.: A multi-GPU implementation and performance model for the standard simplex method. In: Proceedings of the 1st International Symposium and 10th Bal-kan Conference on Operational Research, Thessaloniki, Greece, pp. 312\u2013319 (2011)"},{"key":"17_CR39","doi-asserted-by":"crossref","first-page":"552570","DOI":"10.1016\/j.amc.2014.10.096","volume":"250","author":"N Ploskas","year":"2015","unstructured":"Ploskas, N., Samaras, N.: Efficient GPU-based implementations of simplex type algorithms. Appl. Math. Comput. 250, 552570 (2015)","journal-title":"Appl. Math. Comput."},{"key":"17_CR40","unstructured":"Yarmish, G.: A distributed implementation of the simplex method. Ph.D. thesis, Polytechnic University, Brooklyn (2001)"},{"key":"17_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-61578-4","volume-title":"Applied Parallel Computing","author":"JA Hall","year":"1996","unstructured":"Hall, J.A., McKinnon, K.: PARSMI: a parallel revised simplex algorithm incorporating minor iterations and Devex pricing. In: Madsen, K., Olesen, D., Wa\u015bniewski, J., Dongarra, J. (eds.) PARA 1996. LNCS, vol. 1184, pp. 67\u201376. Springer, Heidelberg (1996)"},{"key":"17_CR42","unstructured":"FICO Xpress Optimization Suite, A parallel simplex solver (2014). http:\/\/www.fico.com\/en\/products\/fico-xpress-optimization-suite"}],"container-title":["Lecture Notes in Computer Science","Algorithms, Probability, Networks, and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24024-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T11:47:38Z","timestamp":1653133658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24024-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319240237","9783319240244"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24024-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}