{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T08:36:08Z","timestamp":1768984568417,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1023\/a:1021858008222","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T18:56:02Z","timestamp":1048272962000},"page":"207-250","source":"Crossref","is-referenced-by-count":115,"title":["Decomposition Algorithms for Stochastic Programming on a Computational Grid"],"prefix":"10.1007","volume":"24","author":[{"given":"Jeff","family":"Linderoth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5113428_CR1","first-page":"45","volume":"69","author":"O. Bahn","year":"1995","unstructured":"O. Bahn, O. du Merle, J.-L. Goffin, and J.P. Vial, \u201cA cutting-plane method from analytic centers for stochastic programming,\u201d Mathematical Programming, Series B, vol. 69, pp. 45-73, 1995.","journal-title":"Mathematical Programming, Series B"},{"key":"5113428_CR2","first-page":"1","volume":"17","author":"J.R. Birge","year":"1987","unstructured":"J.R. Birge, M.A.H. Dempster, H.I. Gassmann, E.A. Gunn, and A.J. King, \u201cA standard input format for multiperiod stochastic linear programs,\u201d COAL Newsletter, vol. 17, pp. 1-19, 1987.","journal-title":"COAL Newsletter"},{"key":"5113428_CR3","first-page":"327","volume":"75","author":"J.R. Birge","year":"1996","unstructured":"J.R. Birge, C.J. Donohue, D.F. Holmes, and O.G. Svintsiski, \u201cA parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs,\u201d Mathematical Programming, vol. 75, pp. 327-352, 1996.","journal-title":"Mathematical Programming"},{"key":"5113428_CR4","volume-title":"ND-UMVersion 1.0: Computer Code for Nested Decomposition Algorithm","author":"J.R. Birge","year":"1998","unstructured":"J.R. Birge, C.J. Donohue, D.F. Holmes, and O.G. Svintsitski, \u201cND-UMVersion 1.0: Computer Code for Nested Decomposition Algorithm,\u201d Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48109-2117, Aug. 1998."},{"key":"5113428_CR5","volume-title":"Introduction to Stochastic Programming, Springer Series in Operations Research","author":"J.R. Birge","year":"1997","unstructured":"J.R. Birge and F. Louveaux, Introduction to Stochastic Programming, Springer Series in Operations Research, Springer: Berlin, 1997."},{"key":"5113428_CR6","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1287\/mnsc.34.12.1472","volume":"34","author":"J.R. Birge","year":"1988","unstructured":"J.R. Birge and L. Qi, \u201cComputing block-angular karmarkar projections with applications to stochastic programming,\u201d Management Science, vol. 34, pp. 1472-1479, 1988.","journal-title":"Management Science"},{"key":"5113428_CR7","unstructured":"D. Buaklee, G. Tracy, M. Vernon, and S.J. Wright, \u201cAn adaptive model to control a large scale application,\u201d in Proceedings of the 16th Annual ACM International Conference on Supercomputing (ICS 2002), June 2002."},{"key":"5113428_CR8","unstructured":"CPLEX Optimization, Inc., Incline Village, NV, Using the CPLEX Callable Library, 1995."},{"key":"5113428_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1023\/A:1019245101545","volume":"99","author":"E. Fragni\u00e8re","year":"2000","unstructured":"E. Fragni\u00e8re, J. Gondzio, and J.-P. Vial, \u201cBuilding and solving large-scale stochastic programs on an affordable distributed computing system,\u201d Annals of Operations Research, vol. 99, pp. 167-187, 2000.","journal-title":"Annals of Operations Research"},{"key":"5113428_CR10","series-title":"Working Paper","volume-title":"A comprehensive input format for stochastic linear programs","author":"H.I. Gassmann","year":"1997","unstructured":"H.I. Gassmann and E. Schweitzer, \u201cA comprehensive input format for stochastic linear programs,\u201d Working Paper WP-96-1, School of Business Administration, Dalhousie University, Halifax, Canada, Dec. 1997."},{"key":"5113428_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5712.001.0001","volume-title":"PVM: Parallel Virtual Machine","author":"A. Geist","year":"1994","unstructured":"A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, PVM: Parallel Virtual Machine, The MIT Press: Cambridge, MA, 1994."},{"key":"5113428_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1011416310759","volume":"4","author":"J.-P. Goux","year":"2001","unstructured":"J.-P. Goux, S. Kulkarni, J.T. Linderoth, and M. Yoder, \u201cMaster-Worker: An enabling framework for masterworker applications on the computational grid,\u201d Cluster Computing, vol. 4, pp. 63-70, 2001.","journal-title":"Cluster Computing"},{"key":"5113428_CR13","volume-title":"Metacomputing and the master-worker paradigm","author":"J.-P. Goux","year":"2000","unstructured":"J.-P. Goux, J.T. Linderoth, and M. Yoder, \u201cMetacomputing and the master-worker paradigm,\u201d Preprint MCS\/ANL-P792-0200, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Ill., Feb. 2000."},{"key":"5113428_CR14","volume-title":"Convex Analysis and Minimization Algorithms II, Comprehensive Studies in Mathematics","author":"J.-B. Hiriart-Urruty","year":"1993","unstructured":"J.-B. Hiriart-Urruty and C. Lemar\u00b4echal, Convex Analysis and Minimization Algorithms II, Comprehensive Studies in Mathematics, Springer-Verlag: Berlin, 1993."},{"key":"5113428_CR15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","volume":"46","author":"K. Kiwiel","year":"1990","unstructured":"K. Kiwiel, \u201cProximity control in bundle methods for convex nondifferentiable minimization,\u201d Mathematical Programming, vol. 46, pp. 105-122, 1990.","journal-title":"Mathematical Programming"},{"key":"5113428_CR16","unstructured":"M. Livny, J. Basney, R. Raman, and T. Tannenbaum, \u201cMechanisms for high throughput computing,\u201d SPEEDUP, vol. 11, 1997. Available from http:\/\/www.cs.wisc.edu\/condor\/doc\/htc mech.ps."},{"key":"5113428_CR17","volume-title":"Nonlinear Programming","author":"O.L. Mangasarian","year":"1969","unstructured":"O.L. Mangasarian, Nonlinear Programming, McGraw-Hill: New York, 1969."},{"key":"5113428_CR18","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1287\/opre.43.3.477","volume":"43","author":"J.M. Mulvey","year":"1995","unstructured":"J.M. Mulvey and A. Ruszczy\u0144ski, \u201cA new scenario decomposition method for large scale stochastic optimization,\u201d Operations Research, vol. 43, pp. 477-490, 1995.","journal-title":"Operations Research"},{"key":"5113428_CR19","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1970."},{"key":"5113428_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01580883","volume":"35","author":"A. Ruszczy\u00b4nski","year":"1986","unstructured":"A. Ruszczy\u00b4nski, \u201cA regularized decomposition method for minimizing a sum of polyhedral functions,\u201d Mathematical Programming, vol. 35, pp. 309-333, 1986.","journal-title":"Mathematical Programming"},{"key":"5113428_CR21","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01581267","volume":"58","author":"A. Ruszczy\u00b4nski","year":"1993","unstructured":"A. Ruszczy\u00b4nski, \u201cParallel decomposition of multistage stochastic programming problems,\u201d Mathematical Programming, vol. 58, pp. 201-228, 1993.","journal-title":"Mathematical Programming"},{"key":"5113428_CR22","series-title":"Working paper","volume-title":"On the regularized decomposition method for two-stage stochastic linear problems","author":"A. Ruszczy\u00b4nski","year":"1996","unstructured":"A. Ruszczy\u00b4nski and A. \u00b4Swietanowski, \u201cOn the regularized decomposition method for two-stage stochastic linear problems,\u201d Working paper WP-96-014, IIASA, Laxenburg, Austria, 1996."},{"key":"5113428_CR23","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF02110042","volume":"3","author":"S. Sen","year":"1994","unstructured":"S. Sen, R.D. Doverspike, and S. Cosares, \u201cNetwork planning with random demand,\u201d Telecommunications Systems, vol. 3, pp. 11-30, 1994.","journal-title":"Telecommunications Systems"},{"key":"5113428_CR24","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1137\/S1052623498349541","volume":"11","author":"A. Shapiro","year":"2000","unstructured":"A. Shapiro and T. Homem de Mello, \u201cOn the rate of convergence of optimal solutions of Monte Carlo approximations of stochastic programs,\u201d SIAM Journal on Optimization, vol. 11, pp. 70-86, 2000.","journal-title":"SIAM Journal on Optimization"},{"key":"5113428_CR25","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"R. Van Slyke","year":"1969","unstructured":"R. Van Slyke and R.J.-B. Wets, \u201cL-shaped linear programs with applications to control and stochastic programming,\u201d SIAM Journal on Applied Mathematics, vol. 17, pp. 638-663, 1969.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"5113428_CR26","volume-title":"Paralleler und Objektorientierter Simplex-Algorithmus","author":"R. Wunderling","year":"1996","unstructured":"R. Wunderling, \u201cParalleler und Objektorientierter Simplex-Algorithmus,\u201d Ph.D. Thesis, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin, 1996."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021858008222.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021858008222\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021858008222.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:12:46Z","timestamp":1752376366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021858008222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":26,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["5113428"],"URL":"https:\/\/doi.org\/10.1023\/a:1021858008222","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}