메뉴 건너뛰기




Volumn 146, Issue 1, 2003, Pages 35-51

A probabilistic solution-generator for simulation

Author keywords

Simulation; Stochastic optimization

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; SET THEORY;

EID: 0037375148     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00215-1     Document Type: Article
Times cited : (4)

References (14)
  • 1
    • 0030303848 scopus 로고    scopus 로고
    • A global search method for discrete stochastic optimization
    • Andradottir S. A global search method for discrete stochastic optimization. SIAM Journal on Optimization. 6:1996.
    • (1996) SIAM Journal on Optimization , vol.6
    • Andradottir, S.1
  • 2
    • 0001446599 scopus 로고    scopus 로고
    • Nelder-Mead simplex modifications for simulation optimization
    • Barton R.R., Ivey J.S. Nelder-Mead simplex modifications for simulation optimization. Management Science. 42:1996;7.
    • (1996) Management Science , vol.42 , pp. 7
    • Barton, R.R.1    Ivey, J.S.2
  • 3
    • 0030522942 scopus 로고    scopus 로고
    • Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
    • Dai L.Y. Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems. Journal of Optimization Theory and Applications. 91:1996.
    • (1996) Journal of Optimization Theory and Applications , vol.91
    • Dai, L.Y.1
  • 8
    • 0033079708 scopus 로고    scopus 로고
    • An explanation of ordinal optimization: Soft computing for hard problems
    • Ho Y.C. An explanation of ordinal optimization: Soft computing for hard problems. International Journal of Information Sciences. 113:1999.
    • (1999) International Journal of Information Sciences , vol.113
    • Ho, Y.C.1
  • 12


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