A comparative study of decomposition algorithms for stochastic combinatorial optimization

Computational Optimization and Applications

Volumn 40, Issue 3, 2008, Pages 299-319

  Ntaimo, Lewis ^a   Sen, Suvrajeet ^b  

^a Texas A and M University   (United States)

^b The Ohio State University   (United States)

Author keywords

Disjunctive decomposition; Stochastic mixed integer programming; Stochastic server location; Strategic supply chain planning

Indexed keywords

AEROSPACE APPLICATIONS; ALGORITHMS; BENCHMARKING; CANNING; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL METHODS; EVOLUTIONARY ALGORITHMS; INDUSTRIAL ECONOMICS; INTEGER PROGRAMMING; SUPPLY CHAINS;

COMPARATIVE STUDIES; COMPUTATIONAL RESULTS; DECOMPOSITION ALGORITHMS; IN ORDER; SERIAL PROCESSING; STOCHASTIC COMBINATORIAL OPTIMIZATION; STRATEGIC SUPPLY CHAIN PLANNING; TEST BEDS;

COMBINATORIAL MATHEMATICS;

EID: 45749093779     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9085-1     Document Type: Article

References (20)

1. Ahmed, S., King, A.J., Parija, G.: A multi-stage stochastic integer programming approach for capacity expansion under uncertainty. J. Glob. Optim. 26, 3-24 (2003)
2. Alonso-Ayuso, A., Escudero, L.F., Garín, A., Ortuńo, M.T., Perez, G.: BFC, a branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs. Eur. J. Oper. Res. 151(3), 503-519 (2003)
3. Alonso-Ayuso, A., Escudero, L.F., Garín, A., Ortuńo, M.T., Perez, G.: An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming. J. Glob. Optim. 26, 97-124 (2003)
4. Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3-51 (1979)
5. Benders, J.F.: Partitioning procedures for solving mixed-variable programming problems. Numer. Math. 4, 238-252 (1962)
6. Booch, G.: Object-Oriented Analysis and Design with Applications, 2nd edn. Benjamin/Cummings, Redwood City (1994)
7. Escudero, L.F., Galindo, E., Gómez, E., García, G., Sabau, V.: SCHUMAN, a modeling framework for supply chain management under uncertainty. Eur. J. Oper. Res. 119, 13-34 (1996)
8. 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)
9. ILOG CPLEX, CPLEX 7.0 Reference Manual, ILOG CPLEX Division, Incline Village, NV (2000)
10. Laporte, G., Louveaux, F.V.: The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13, 133-142 (1993)
11. MirHassani, S.A., Lucas, C., Mitra, G., Poojari, C.A.: Computational solution of capacity planning model under uncertainty. Parallel Comput. J. 26(5), 511-538 (2000)
12. Ntaimo, L.: Decomposition algorithms for stochastic combinatorial optimization: computational experiments and extensions. Ph.D. dissertation, University of Arizona, Tucson, USA
13. Ntaimo, L., Sen, S.: The million-variable 'march' for stochastic combinatorial optimization. J. Glob. Optim. 32(3), 385-400 (2005)
14. 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-109 (2004)
15. 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 6, pp. 105-123. Kluwer Academic, Dordrecht (2002)
16. 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-20 (2005)
17. Sen, S., Sherali, H.D.: Decomposition with branch-and-cut approaches for two stage stochastic mixed-integer programming. Math. Program. 106(2), 203-223 (2006)
18. 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-333 (2003)
19. Wang, Q., Batta, E., Rump, C.M.: Facility location models for immobile servers with stochastic demand. Nav. Res. Log. 51, 137-152 (2004)
20. Wets, R.J.-B.: Stochastic programs with fixed recourse: the equivalent deterministic problem. SIAM Rev. 16, 309-339 (1974)