{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T17:28:56Z","timestamp":1760549336547},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,2,20]],"date-time":"2013-02-20T00:00:00Z","timestamp":1361318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10589-013-9542-y","type":"journal-article","created":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T22:39:27Z","timestamp":1361313567000},"page":"571-596","source":"Crossref","is-referenced-by-count":22,"title":["Parallel distributed-memory simplex for large-scale stochastic LP problems"],"prefix":"10.1007","volume":"55","author":[{"given":"Miles","family":"Lubin","sequence":"first","affiliation":[]},{"given":"J. A. Julian","family":"Hall","sequence":"additional","affiliation":[]},{"given":"Cosmin G.","family":"Petra","sequence":"additional","affiliation":[]},{"given":"Mihai","family":"Anitescu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,20]]},"reference":[{"key":"9542_CR1","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1145\/1465482.1465560","volume-title":"Proceedings of the April 18\u201320, 1967, Spring Joint Computer Conference, AFIPS \u201967 (Spring)","author":"G.M. Amdahl","year":"1967","unstructured":"Amdahl, G.M.: Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the April 18\u201320, 1967, Spring Joint Computer Conference, AFIPS \u201967 (Spring), pp. 483\u2013485. ACM, New York (1967)"},{"key":"9542_CR2","doi-asserted-by":"crossref","first-page":"1860","DOI":"10.1137\/S1064827502401953","volume":"25","author":"C. Aykanat","year":"2004","unstructured":"Aykanat, C., Pinar, A., \u00c7ataly\u00fcrek, U.V.: Permuting sparse rectangular matrices into block-diagonal form. SIAM J. Sci. Comput. 25, 1860\u20131879 (2004)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"9542_CR3","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1287\/opre.14.4.636","volume":"14","author":"J.M. Bennett","year":"1966","unstructured":"Bennett, J.M.: An approach to some structured linear programming problems. Oper. Res. 14(4), 636\u2013645 (1966)","journal-title":"Oper. Res."},{"key":"9542_CR4","series-title":"Springer Series in Operations Research and Financial Engineering","doi-asserted-by":"crossref","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, 2nd edn. Springer Series in Operations Research and Financial Engineering. Springer, New York (2011)","edition":"2"},{"key":"9542_CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01584341","volume":"13","author":"J. Bisschop","year":"1977","unstructured":"Bisschop, J., Meeraus, A.: Matrix augmentation and partitioning in the updating of the basis inverse. Math. Program. 13, 241\u2013254 (1977)","journal-title":"Math. Program."},{"issue":"46","key":"9542_CR6","doi-asserted-by":"crossref","first-page":"64","DOI":"10.2307\/2001993","volume":"8","author":"G.B. Dantzig","year":"1954","unstructured":"Dantzig, G.B., Orchard-Hays, W.: The product form for the inverse in the simplex method. Math. Tables Other Aids Comput. 8(46), 64\u201367 (1954)","journal-title":"Math. Tables Other Aids Comput."},{"key":"9542_CR7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems. Fundamentals of Algorithms","author":"T. Davis","year":"2006","unstructured":"Davis, T.: Direct Methods for Sparse Linear Systems. Fundamentals of Algorithms. Society for Industrial and Applied Mathematics, Philadelphia (2006)"},{"key":"9542_CR8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/992200.992201","volume":"30","author":"I.S. Duff","year":"2004","unstructured":"Duff, I.S., Scott, J.A.: A\u00a0parallel direct solver for large sparse highly unsymmetric linear systems. ACM Trans. Math. Softw. 30, 95\u2013117 (2004)","journal-title":"ACM Trans. Math. Softw."},{"key":"9542_CR9","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01581089","volume":"57","author":"J.J. Forrest","year":"1992","unstructured":"Forrest, J.J., Goldfarb, D.: Steepest-edge simplex algorithms for linear programming. Math. Program. 57, 341\u2013374 (1992)","journal-title":"Math. Program."},{"key":"9542_CR10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01584548","volume":"2","author":"J.J.H. Forrest","year":"1972","unstructured":"Forrest, J.J.H., Tomlin, J.A.: Updated triangular factors of the basis to maintain sparsity in the product form simplex method. Math. Program. 2, 263\u2013278 (1972)","journal-title":"Math. Program."},{"key":"9542_CR11","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0909058","volume":"9","author":"J.R. Gilbert","year":"1988","unstructured":"Gilbert, J.R., Peierls, T.: Sparse partial pivoting in time proportional to arithmetic operations. SIAM J. Sci. Stat. Comput. 9, 862\u2013874 (1988)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"9542_CR12","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01589114","volume":"45","author":"P.E. Gill","year":"1989","unstructured":"Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H.: A\u00a0practical anti-cycling procedure for linearly constrained optimization. Math. Program. 45, 437\u2013474 (1989)","journal-title":"Math. Program."},{"key":"9542_CR13","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"9542_CR14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10287-008-0090-3","volume":"6","author":"J. Gondzio","year":"2009","unstructured":"Gondzio, J., Grothey, A.: Exploiting structure in parallel implementation of interior point methods for optimization. Comput. Manag. Sci. 6, 135\u2013160 (2009)","journal-title":"Comput. Manag. Sci."},{"key":"9542_CR15","volume-title":"Introduction to Parallel Computing","author":"A. Grama","year":"2003","unstructured":"Grama, A., Karypis, G., Kumar, V., Gupta, A.: Introduction to Parallel Computing, 2nd edn. Addison-Wesley, Reading (2003)","edition":"2"},{"key":"9542_CR16","volume-title":"Using MPI-2: Advanced Features of the Message Passing Interface","author":"W. Gropp","year":"1999","unstructured":"Gropp, W., Thakur, R., Lusk, E.: Using MPI-2: Advanced Features of the Message Passing Interface, 2nd edn. MIT Press, Cambridge (1999)","edition":"2"},{"key":"9542_CR17","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.: Hyper-sparsity in the revised simplex method and how to exploit it. Comput. Optim. Appl. 32, 259\u2013283 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"9542_CR18","doi-asserted-by":"crossref","unstructured":"Hall, J.A.J., Smith, E.: A\u00a0high performance primal revised simplex solver for row-linked block angular linear programming problems. Tech. Rep. ERGO-12-003, School of Mathematics, University of Edinburgh (2012)","DOI":"10.1007\/978-3-642-31464-3_15"},{"key":"9542_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"P.M.J. Harris","year":"1973","unstructured":"Harris, P.M.J.: Pivot selection methods of the DEVEX LP code. Math. Program. 5, 1\u201328 (1973)","journal-title":"Math. Program."},{"key":"9542_CR20","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01601939","volume":"30","author":"P. Kall","year":"1979","unstructured":"Kall, P.: Computational methods for solving two-stage stochastic linear programming problems. Z. Angew. Math. Phys. 30, 261\u2013271 (1979)","journal-title":"Z. Angew. Math. Phys."},{"key":"9542_CR21","unstructured":"Koberstein, A.: The dual simplex method, techniques for a fast and stable implementation. Ph.D. thesis, Universit\u00e4t Paderborn, Paderborn, Germany (2005)"},{"key":"9542_CR22","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10589-008-9207-4","volume":"41","author":"A. Koberstein","year":"2008","unstructured":"Koberstein, A.: Progress in the dual simplex algorithm for solving large scale LP problems: techniques for a fast and stable implementation. Comput. Optim. Appl. 41, 185\u2013204 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"9542_CR23","volume-title":"Optimization Theory for Large Systems","author":"L.S. Lasdon","year":"1970","unstructured":"Lasdon, L.S.: Optimization Theory for Large Systems. Macmillan, New York (1970)"},{"key":"9542_CR24","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1021858008222","volume":"24","author":"J. Linderoth","year":"2003","unstructured":"Linderoth, J., Wright, S.: Decomposition algorithms for stochastic programming on a computational grid. Comput. Optim. Appl. 24, 207\u2013250 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"9542_CR25","first-page":"64:1","volume-title":"Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, SC \u201911","author":"M. Lubin","year":"2011","unstructured":"Lubin, M., Petra, C.G., Anitescu, M., Zavala, V.: Scalable stochastic optimization of complex energy systems. In: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, SC \u201911, pp. 64:1\u201364:64. ACM, New York (2011)"},{"issue":"3","key":"9542_CR26","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1287\/mnsc.3.3.255","volume":"3","author":"H.M. Markowitz","year":"1957","unstructured":"Markowitz, H.M.: The elimination form of the inverse and its application to linear programming. Manag. Sci. 3(3), 255\u2013269 (1957)","journal-title":"Manag. Sci."},{"key":"9542_CR27","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.: Computational Techniques of the Simplex Method. Kluwer Academic, Norwell (2003)"},{"key":"9542_CR28","first-page":"199","volume":"12","author":"J. Stern","year":"1993","unstructured":"Stern, J., Vavasis, S.: Active set methods for problems in column block angular form. Comput. Appl. Math. 12, 199\u2013226 (1993)","journal-title":"Comput. Appl. Math."},{"key":"9542_CR29","first-page":"263","volume-title":"Stochastic Programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974)","author":"B. Strazicky","year":"1980","unstructured":"Strazicky, B.: Some results concerning an algorithm for the discrete recourse problem. In: Stochastic Programming (Proc. Internat. Conf., Univ. Oxford, Oxford, 1974), pp. 263\u2013274. Academic Press, London (1980)"},{"key":"9542_CR30","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02025534","volume":"43","author":"L.M. Suhl","year":"1993","unstructured":"Suhl, L.M., Suhl, U.H.: A\u00a0fast LU update for linear programming. Ann. Oper. Res. 43, 33\u201347 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9542_CR31","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1287\/ijoc.2.4.325","volume":"2","author":"U.H. Suhl","year":"1990","unstructured":"Suhl, U.H., Suhl, L.M.: Computing sparse LU factorizations for large-scale linear programming bases. ORSA J. Comput. 2(4), 325 (1990)","journal-title":"ORSA J. Comput."},{"key":"9542_CR32","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1018977102079","volume":"90","author":"H. Vladimirou","year":"1999","unstructured":"Vladimirou, H., Zenios, S.: Scalable parallel computations for large-scale stochastic programming. Ann. Oper. Res. 90, 87\u2013129 (1999)","journal-title":"Ann. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9542-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9542-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9542-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,9]],"date-time":"2022-02-09T01:01:19Z","timestamp":1644368479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9542-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,20]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9542"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9542-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,20]]}}}