{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:51:58Z","timestamp":1648824718260},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T00:00:00Z","timestamp":1470960000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10100-016-0452-9","type":"journal-article","created":{"date-parts":[[2016,8,12]],"date-time":"2016-08-12T09:09:45Z","timestamp":1470992985000},"page":"967-984","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Parallel search paths for the simplex algorithm"],"prefix":"10.1007","volume":"25","author":[{"given":"P\u00e9ter","family":"Tar","sequence":"first","affiliation":[]},{"given":"B\u00e1lint","family":"St\u00e1gel","sequence":"additional","affiliation":[]},{"given":"Istv\u00e1n","family":"Maros","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,12]]},"reference":[{"key":"452_CR1","doi-asserted-by":"crossref","unstructured":"Bieling J, Peschlow P, Martini P (2010) An efficient GPU implementation of the revised simplex method. In: 2010 IEEE international symposium on parallel distributed processing, workshops and PhD Forum (IPDPSW), pp 1\u20138","DOI":"10.1109\/IPDPSW.2010.5470831"},{"issue":"1","key":"452_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"R Bixby","year":"2002","unstructured":"Bixby R (2002) Solving real-world linear programs: a decade and more of progress. Oper Res 50(1):3\u201315","journal-title":"Oper Res"},{"issue":"1","key":"452_CR3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/ijoc.12.1.45.11902","volume":"12","author":"R Bixby","year":"2000","unstructured":"Bixby R, Martin A (2000) Parallelizing the dual simplex method. INFORMS J Comput 12(1):45\u201356","journal-title":"INFORMS J Comput"},{"issue":"2","key":"452_CR4","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1287\/opre.38.2.240","volume":"38","author":"W Carolan","year":"1990","unstructured":"Carolan W, Hill J, Kennington J, Niemi S, Wichmann S (1990) An empirical evaluation of the KORBX algorithms for military airlift applications. Oper Res 38(2):240\u2013248","journal-title":"Oper Res"},{"issue":"2\u20133","key":"452_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00127844","volume":"5","author":"Z Cvetanovic","year":"1991","unstructured":"Cvetanovic Z, Freedman E, Nofsinger C (1991) Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and Sparse solvers. J Supercomput 5(2\u20133):219\u2013238","journal-title":"J Supercomput"},{"key":"452_CR6","doi-asserted-by":"crossref","DOI":"10.1515\/9781400884179","volume-title":"Linear programming and extensions","author":"G Dantzig","year":"1963","unstructured":"Dantzig G (1963) Linear programming and extensions. Princeton University Press, Princeton"},{"issue":"46","key":"452_CR7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.2307\/2001993","volume":"8","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Orchard-Hays W (1954) The product form for the inverse in the simplex method. Math Tables Other Aids Comput 8(46):64\u201367","journal-title":"Math Tables Other Aids Comput"},{"issue":"4","key":"452_CR8","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1287\/ijoc.7.4.402","volume":"7","author":"J Eckstein","year":"1995","unstructured":"Eckstein J, Boduro\u011flu I, Polymenakos L, Goldfarb D (1995) Data-parallel implementations of dense simplex methods on the connection machine CM-2. ORSA J Comput 7(4):402\u2013416","journal-title":"ORSA J Comput"},{"key":"452_CR9","first-page":"10","volume":"13","author":"D Gay","year":"1985","unstructured":"Gay D (1985) Electronic mail distribution of linear programming test problems. Math Program Soc COAL Newsl 13:10\u201312","journal-title":"Math Program Soc COAL Newsl"},{"issue":"1\u20133","key":"452_CR10","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01589114","volume":"45","author":"P Gill","year":"1989","unstructured":"Gill P, Murray W, Saunders M, Wright M (1989) A practical anti-cycling procedure for linearly constrained optimization. Math Program 45(1\u20133):437\u2013474","journal-title":"Math Program"},{"key":"452_CR11","unstructured":"Grama A, Karypia G, Gupta A, Kumar V (2003) Introduction to parallel computing: design and analysis of algorithms. Addison-Wesley, Reading"},{"issue":"2","key":"452_CR12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10287-008-0080-5","volume":"7","author":"J Hall","year":"2010","unstructured":"Hall J (2010) Towards a practical parallelisation of the simplex method. Comput Manag Sci 7(2):139\u2013170","journal-title":"Comput Manag Sci"},{"key":"452_CR13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-3-642-31464-3_15","volume-title":"Parallel Processing and Applied Mathematics. Lecture Notes in Computer Science","author":"J Hall","year":"2012","unstructured":"Hall J, Huangfu Q (2012) A high performance dual revised simplex solver. In: Wyrzykowski R, Dongarra J, Karczewski K, Wa\u015bniewski J (eds) Parallel Processing and Applied Mathematics. Lecture Notes in Computer Science, vol 7203. Springer, Berlin, pp 143\u2013151"},{"key":"452_CR14","first-page":"359","volume-title":"Applied parallel computing industrial computation and optimization. Lecture notes in computer science","author":"J Hall","year":"1996","unstructured":"Hall J, McKinnon K (1996) PARSMI, a parallel revised simplex algorithm incorporating minor iterations and Devex pricing. In: Wa\u015bniewski J, Dongarra J, Madsen K, Olesen D (eds) Applied parallel computing industrial computation and optimization. Lecture notes in computer science, vol 1184. Berlin, Springer, pp 359\u2013368"},{"key":"452_CR15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1023\/A:1018957107705","volume":"81","author":"J Hall","year":"1998","unstructured":"Hall J, McKinnon K (1998) ASYNPLEX, an asynchronous parallelrevised simplex algorithm. Ann Oper Res 81:27\u201350","journal-title":"Ann Oper Res"},{"issue":"3","key":"452_CR16","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10589-005-4802-0","volume":"32","author":"J Hall","year":"2005","unstructured":"Hall J, McKinnon K (2005) Hyper-sparsity in the revised simplex method and how to exploit it. Comput Optim Appl 32(3):259\u2013283","journal-title":"Comput Optim Appl"},{"issue":"1","key":"452_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02186472","volume":"14","author":"R Helgason","year":"1988","unstructured":"Helgason R, Kennington J, Zaki H (1988) A parallelization of the simplex method. Ann Oper Res 14(1):17\u201340","journal-title":"Ann Oper Res"},{"issue":"4","key":"452_CR18","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01299209","volume":"3","author":"J Ho","year":"1994","unstructured":"Ho J, Sundarraj R (1994) On the efficacy of distributed simplex algorithms for linear programming. Comput Optim Appl 3(4):349\u2013363","journal-title":"Comput Optim Appl"},{"issue":"3","key":"452_CR19","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10589-014-9689-1","volume":"60","author":"Q Huangfu","year":"2015","unstructured":"Huangfu Q, Hall J (2015a) Novel update techniques for the revised simplex method. Comput Optim Appl 60(3):587\u2013608","journal-title":"Comput Optim Appl"},{"key":"452_CR20","unstructured":"Huangfu Q, Hall J (2015b) Parallelizing the dual revised simplex method. Technical report, Cornell University"},{"key":"452_CR21","unstructured":"Koberstein A (2005) The dual simplex method, techniques for a fast and stable implementation. PhD thesis, Universit\u00e4t Paderborn, Paderborn"},{"key":"452_CR22","doi-asserted-by":"crossref","unstructured":"Lalami M, Boyer V, El-Baz D (2011) Efficient implementation of the simplex method on a CPU-GPU system. In: Proceedings of the 2011 IEEE international symposium on parallel and distributed processing workshops and PhD Forum, IPDPSW\u201911, Washington, DC, USA. IEEE Computer Society, pp 1999\u20132006","DOI":"10.1109\/IPDPS.2011.362"},{"issue":"3","key":"452_CR23","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1287\/mnsc.3.3.255","volume":"3","author":"HM Markowitz","year":"1957","unstructured":"Markowitz HM (1957) The elimination form of the inverse and its application to linear programming. Manag Sci 3(3):255\u2013269","journal-title":"Manag Sci"},{"issue":"1\u20134","key":"452_CR24","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/B:ANOR.0000004769.36807.cf","volume":"124","author":"I Maros","year":"2003","unstructured":"Maros I (2003a) A general pricing scheme for the simplex method. Ann Oper Res 124(1\u20134):193\u2013203","journal-title":"Ann Oper Res"},{"key":"452_CR25","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 (2003b) Computational techniques of the simplex method. Kluwer Academic Publishers, Norwell"},{"issue":"2","key":"452_CR26","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/S0377-2217(02)00072-3","volume":"140","author":"I Maros","year":"2002","unstructured":"Maros I, Khaliq M (2002) Advances in design and implementation of optimization software. Eur J Oper Res 140(2):322\u2013337","journal-title":"Eur J Oper Res"},{"issue":"1","key":"452_CR27","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0167-8191(99)00100-3","volume":"26","author":"I Maros","year":"2000","unstructured":"Maros I, Mitra G (2000) Investigating the sparse simplex algorithm on a distributed memory multiprocessor. Parallel Comput 26(1):151\u2013170","journal-title":"Parallel Comput"},{"issue":"1","key":"452_CR28","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1006\/jpdc.1995.1142","volume":"31","author":"W Shu","year":"1995","unstructured":"Shu W (1995) Parallel Implementation of a sparse simplex algorithm on MIMD distributed memory computers. J Paral Distrib Comput 31(1):25\u201340","journal-title":"J Paral Distrib Comput"},{"key":"452_CR29","unstructured":"St\u00e1gel B, Tar P, Maros I (2015) The Pannon Optimizer - a linear programming solver for research purposes. In: Proceedings of the 5th international conference on recent achievements in mechatronics, automation, computer science and robotics, vol 1(1), pp 293\u2013301"},{"key":"452_CR30","unstructured":"Tar P, Maros I (2012) Product form of the inverse revisited. In: 3rd student conference on operational research, Ravizza S, Holborn P (eds) OpenAccess Series in Informatics (OASIcs), Dagstuhl, Germany. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, vol\u00a022, pp 64\u201374"},{"key":"452_CR31","unstructured":"University of Pannonia (2015) Pannon optimizer. \n                        http:\/\/sourceforge.net\/projects\/pannonoptimizer\/"},{"key":"452_CR32","unstructured":"Yarmish G (2001) A distributed implementation of the simplex method. PhD thesis, Polytechnic University, Brooklyn, NY, USA. AAI3006399"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-016-0452-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-016-0452-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-016-0452-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-016-0452-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,14]],"date-time":"2017-10-14T09:18:08Z","timestamp":1507972688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-016-0452-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,12]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["452"],"URL":"https:\/\/doi.org\/10.1007\/s10100-016-0452-9","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,12]]}}}