메뉴 건너뛰기




Volumn 32, Issue 3, 2005, Pages 385-400

The million-variable "March" for stochastic combinatorial optimization

Author keywords

Combinatorial optimization; Stochastic mixed integer programming; Stochastic server location

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; DECOMPOSITION; PROBLEM SOLVING; RANDOM PROCESSES;

EID: 25444471863     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10898-004-5910-6     Document Type: Article
Times cited : (77)

References (20)
  • 1
    • 85045374139 scopus 로고    scopus 로고
    • Dynamic capacity acquisition and assignment under uncertainty
    • in press
    • Ahmed, S. and Garcia, R. (in press), Dynamic capacity acquisition and assignment under uncertainty, Annals of Operational Research.
    • Annals of Operational Research.
    • Ahmed, S.1    Garcia, R.2
  • 2
    • 21144438339 scopus 로고    scopus 로고
    • A finite branch and bound algorithm for two-stage stochastic integer programs
    • in press
    • Ahmed, S., Tawarmalani, M. and Sahinidis, N.V. (in press), A finite branch and bound algorithm for two-stage stochastic integer programs, Mathematical Programming, http://www.isye.gatech.edu/so/publications/.
    • Mathematical Programming
    • Ahmed, S.1    Tawarmalani, M.2    Sahinidis, N.V.3
  • 3
    • 25444514758 scopus 로고    scopus 로고
    • Exact solutions to a class of stochastic generalized assignment problems
    • SOM, University of Groningen, The Netherlands
    • Albareda-Sambola, M., van der Vlerk, M.H. and Fernandez, E. (2002), Exact solutions to a class of stochastic generalized assignment problems. Research Report 02A11, SOM, University of Groningen, The Netherlands, http://som.rug.nl.
    • (2002) Research Report 02A11
    • Albareda-Sambola, M.1    Van Der Vlerk, M.H.2    Fernandez, E.3
  • 4
    • 0006778493 scopus 로고    scopus 로고
    • A stochastic 0-1 program based approach for the air traffic flow management problem
    • Alonso, A., Escudero, L.F. and Ortuńo, M.T. (2000), A stochastic 0-1 program based approach for the air traffic flow management problem. European Journal of Operations Research 120, 47-62.
    • (2000) European Journal of Operations Research , vol.120 , pp. 47-62
    • Alonso, A.1    Escudero, L.F.2    Ortuńo, M.T.3
  • 5
    • 84867995959 scopus 로고    scopus 로고
    • An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
    • Alonso-Ayuso, A., Escudero, L.F., Garín, A., Ortuńo, M.T. and Perez, G. (2003), An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming. Journal of Global Optimization 26, 97-124.
    • (2003) Journal of Global Optimization , vol.26 , pp. 97-124
    • Alonso-Ayuso, A.1    Escudero, L.F.2    Garín, A.3    Ortuńo, M.T.4    Perez, G.5
  • 10
    • 25444490395 scopus 로고    scopus 로고
    • Private communication
    • Doverspike, R.D. (2003), Private communication.
    • (2003)
    • Doverspike, R.D.1
  • 11
    • 0038589175 scopus 로고    scopus 로고
    • ILOG CPLEX Division, Incline Village, NV
    • ILOG, IL. (2000), CPLEX 7.0 Reference Manual, ILOG CPLEX Division, Incline Village, NV.
    • (2000) CPLEX 7.0 Reference Manual
  • 12
    • 21144453283 scopus 로고
    • Selection of an optimal subset of sizes
    • University of California, Davis, CA
    • Jorjani, S., Scott, C.H. and Woodruff, D.L. (1995), Selection of an optimal subset of sizes. Technical report, University of California, Davis, CA.
    • (1995) Technical Report
    • Jorjani, S.1    Scott, C.H.2    Woodruff, D.L.3
  • 13
    • 0000415520 scopus 로고
    • The integer L-shaped method for stochastic integer programs with complete recourse
    • Laporte, G. and Louveaux, F.V. (1993), The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters 1, 133-142.
    • (1993) Operations Research Letters , vol.1 , pp. 133-142
    • Laporte, G.1    Louveaux, F.V.2
  • 14
    • 0036563024 scopus 로고    scopus 로고
    • An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands
    • Laporte, G., Louveaux, F.V. and van Hamme, L. (2002), An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands, Operations Research 50, 415-423.
    • (2002) Operations Research , vol.50 , pp. 415-423
    • Laporte, G.1    Louveaux, F.V.2    Van Hamme, L.3
  • 15
    • 0037319402 scopus 로고    scopus 로고
    • Decomposition algorithms for stochastic programming on a computational grid
    • Linderoth, J. and Wright, S.J. (2003), Decomposition algorithms for stochastic programming on a computational grid. Computational Optimization and Applications 24, 207-250.
    • (2003) Computational Optimization and Applications , vol.24 , pp. 207-250
    • Linderoth, J.1    Wright, S.J.2
  • 16
    • 25444523513 scopus 로고    scopus 로고
    • Algorithms for stochastic mixed-integer programming models
    • Aardal, K., Nemhauser, G. and Weismantel, R. (eds.), Dordrecht, The Netherlands, Chapter 18
    • Sen, S. (2003), Algorithms for stochastic mixed-integer programming models. In: Aardal, K., Nemhauser, G. and Weismantel, R. (eds.), Stochastic Integer Programming Handbook, Dordrecht, The Netherlands, Chapter 18. http://www.sie.arizona.edu/MORE/papers/SIPHbook.pdf.
    • (2003) Stochastic Integer Programming Handbook
    • Sen, S.1
  • 18
    • 1942475791 scopus 로고    scopus 로고
    • The C3 theorem and a D2 algorithm for large scale stochastic integer programming: Set convexification
    • Sen, S. and Higle, J.L. (2000), The C3 theorem and a D2 algorithm for large scale stochastic integer programming: Set convexification. Stochastic E-Print Series, http://dochost.rz.huberlin.de/speps/.
    • (2000) Stochastic E-print Series
    • Sen, S.1    Higle, J.L.2
  • 19
    • 25444472618 scopus 로고    scopus 로고
    • A summary and illustration of disjunctive decomposition with set convexification
    • Woodruff, D.L. (ed.), Kluwer Academic Press, Dordrecht, The Netherlands, Chapter 6
    • Sen, S., Higle, J.L. and Ntaimo, L. (2002), A summary and illustration of disjunctive decomposition with set convexification. In: Woodruff, D.L. (ed.), Stochastic Integer Programming and Network. Interdiction Models, Kluwer Academic Press, Dordrecht, The Netherlands, Chapter 6.
    • (2002) Stochastic Integer Programming and Network. Interdiction Models
    • Sen, S.1    Higle, J.L.2    Ntaimo, L.3
  • 20
    • 24944592692 scopus 로고    scopus 로고
    • Approximation in stochastic integer programming
    • SOM, Univ. of Groningen, The Netherlands
    • Stougie, L. and van der Vlerk, M.H. (2003), Approximation in stochastic integer programming. Research Report Q3A14, SOM, Univ. of Groningen, The Netherlands, http://www.ub.rug.n1/eldoc/som/a/03A14/03A14.pdf.
    • (2003) Research Report Q3A14
    • Stougie, L.1    Van Der Vlerk, M.H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.