{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:10:28Z","timestamp":1761894628879},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T00:00:00Z","timestamp":1193097600000},"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":[[2008,7]]},"DOI":"10.1007\/s10589-007-9085-1","type":"journal-article","created":{"date-parts":[[2007,10,22]],"date-time":"2007-10-22T17:48:55Z","timestamp":1193075335000},"page":"299-319","source":"Crossref","is-referenced-by-count":23,"title":["A comparative study of decomposition algorithms for stochastic combinatorial optimization"],"prefix":"10.1007","volume":"40","author":[{"given":"Lewis","family":"Ntaimo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suvrajeet","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,23]]},"reference":[{"key":"9085_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1023062915106","volume":"26","author":"S. Ahmed","year":"2003","unstructured":"Ahmed, S., King, A.J., Parija, G.: A multi-stage stochastic integer programming approach for capacity expansion under uncertainty. J. Glob. Optim. 26, 3\u201324 (2003)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9085_CR2","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/S0377-2217(02)00628-8","volume":"151","author":"A. Alonso-Ayuso","year":"2003","unstructured":"Alonso-Ayuso, A., Escudero, L.F., Gar\u00edn, A., Ortu\u0144o, M.T., Perez, G.: BFC, a branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0\u20131 programs. Eur. J. Oper. Res. 151(3), 503\u2013519 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9085_CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/A:1023071216923","volume":"26","author":"A. Alonso-Ayuso","year":"2003","unstructured":"Alonso-Ayuso, A., Escudero, L.F., Gar\u00edn, A., Ortu\u0144o, M.T., Perez, G.: An approach for strategic supply chain planning under uncertainty based on stochastic 0\u20131 programming. J. Glob. Optim. 26, 97\u2013124 (2003)","journal-title":"J. Glob. Optim."},{"key":"9085_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discrete Math."},{"key":"9085_CR5","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variable programming problems. Numer. Math. 4, 238\u2013252 (1962)","journal-title":"Numer. Math."},{"key":"9085_CR6","volume-title":"Object-Oriented Analysis and Design with Applications","author":"G. Booch","year":"1994","unstructured":"Booch, G.: Object-Oriented Analysis and Design with Applications, 2nd edn. Benjamin\/Cummings, Redwood City (1994)","edition":"2"},{"key":"9085_CR7","first-page":"13","volume":"119","author":"L.F. Escudero","year":"1996","unstructured":"Escudero, L.F., Galindo, E., G\u00f3mez, E., Garc\u00eda, G., Sabau, V.: SCHUMAN, a modeling framework for supply chain management under uncertainty. Eur. J. Oper. Res. 119, 13\u201334 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9085_CR8","unstructured":"Goux, J.-P., Linderoth, J., Yoder, M.: Metacomputing and the master-worker paradigm. Preprint ANL\/MCS-P792-0200, MCS Division, Argonne National Laboratories, Chicago, IL (2000)"},{"key":"9085_CR9","unstructured":"ILOG CPLEX, CPLEX 7.0 Reference Manual, ILOG CPLEX Division, Incline Village, NV (2000)"},{"key":"9085_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G. Laporte","year":"1993","unstructured":"Laporte, G., Louveaux, F.V.: The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13, 133\u2013142 (1993)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"9085_CR11","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0167-8191(99)00118-0","volume":"26","author":"S.A. MirHassani","year":"2000","unstructured":"MirHassani, S.A., Lucas, C., Mitra, G., Poojari, C.A.: Computational solution of capacity planning model under uncertainty. Parallel Comput.\u00a0J. 26(5), 511\u2013538 (2000)","journal-title":"Parallel Comput.\u00a0J."},{"key":"9085_CR12","unstructured":"Ntaimo, L.: Decomposition algorithms for stochastic combinatorial optimization: computational experiments and extensions. Ph.D. dissertation, University of Arizona, Tucson, USA"},{"issue":"3","key":"9085_CR13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s10898-004-5910-6","volume":"32","author":"L. Ntaimo","year":"2005","unstructured":"Ntaimo, L., Sen, S.: The million-variable \u2018march\u2019 for stochastic combinatorial optimization. J. Glob. Optim. 32(3), 385\u2013400 (2005)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9085_CR14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1023\/B:TELS.0000029022.63021.09","volume":"26","author":"M. Riis","year":"2004","unstructured":"Riis, M., Skriver, A.J.V., Lodahl, J.: Deployment of mobile switching centers in a telecommunications network: A stochastic programming approach. Telecommun. Syst. 26(1), 93\u2013109 (2004)","journal-title":"Telecommun. Syst."},{"key":"9085_CR15","first-page":"105","volume-title":"Stochastic Integer Programming and Network Interdiction Models, Chapter\u00a06","author":"S. Sen","year":"2002","unstructured":"Sen, S., Higle, J.L., Ntaimo, L.: A summary and illustration of disjunctive decomposition with set convexification. In: Woodruff, D.L. (ed.) Stochastic Integer Programming and Network Interdiction Models, Chapter\u00a06, pp. 105\u2013123. Kluwer Academic, Dordrecht (2002)"},{"issue":"1","key":"9085_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-004-0566-z","volume":"104","author":"S. Sen","year":"2005","unstructured":"Sen, S., Higle, J.L.: The C3 theorem and a D2 algorithm for large scale stochastic mixed-integer programming: set convexification. Math. Program. 104(1), 1\u201320 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"9085_CR17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10107-005-0592-5","volume":"106","author":"S. Sen","year":"2006","unstructured":"Sen, S., Sherali, H.D.: Decomposition with branch-and-cut approaches for two stage stochastic mixed-integer programming. Math. Program. 106(2), 203\u2013223 (2006)","journal-title":"Math. Program."},{"key":"9085_CR18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B. Verweij","year":"2003","unstructured":"Verweij, B., Ahmed, S., Kleywegt, A.J., Nemhauser, G., Shapiro, A.: The sample average approximation method applied to stochastic routing problems: a computational study. Comput. Optim. Appl. 24, 289\u2013333 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"9085_CR19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/nav.10110","volume":"51","author":"Q. Wang","year":"2004","unstructured":"Wang, Q., Batta, E., Rump, C.M.: Facility location models for immobile servers with stochastic demand. Nav. Res. Log. 51, 137\u2013152 (2004)","journal-title":"Nav. Res. Log."},{"key":"9085_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/1016053","volume":"16","author":"R.J.-B. Wets","year":"1974","unstructured":"Wets, R.J.-B.: Stochastic programs with fixed recourse: the equivalent deterministic problem. SIAM Rev. 16, 309\u2013339 (1974)","journal-title":"SIAM Rev."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9085-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9085-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9085-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:32Z","timestamp":1559302592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9085-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,23]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9085"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9085-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,23]]}}}