메뉴 건너뛰기




Volumn 136, Issue 1, 2005, Pages 65-80

Approximate solutions of continuous dispersion problems

Author keywords

Computer experiments; Location theory; Maximin distance designs; Nonlinear programming; Space filling designs

Indexed keywords


EID: 18844420263     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-005-2039-z     Document Type: Conference Paper
Times cited : (10)

References (21)
  • 2
    • 0004601465 scopus 로고    scopus 로고
    • Case studies in design and analysis of computer experiments
    • American Statistical Association
    • Booker, A.J. (1996). "Case Studies in Design and Analysis of Computer Experiments." In Proceedings of the Section on Physical and Engineering Sciences. American Statistical Association, pp. 244-248.
    • (1996) Proceedings of the Section on Physical and Engineering Sciences , pp. 244-248
    • Booker, A.J.1
  • 3
    • 84872996278 scopus 로고    scopus 로고
    • Master's thesis, College of William & Mary. This research project was completed in partial fulfillment of the requirements for a master's degree in Computational Operations Research
    • Dimnaku, A. (2000). "Approximate Solutions of Continuous p-Dispersion Using Non-linear Programming." Master's thesis, College of William & Mary. This research project was completed in partial fulfillment of the requirements for a master's degree in Computational Operations Research.
    • (2000) Approximate Solutions of Continuous P-Dispersion Using Non-linear Programming
    • Dimnaku, A.1
  • 4
    • 84974859436 scopus 로고
    • Solving the continuous p-dispersion problem using non-linear programming
    • Drezner, Z. and E. Erkut. (1995). "Solving the Continuous p-Dispersion Problem Using Non-linear Programming." Journal of the Operational Research Society 46, 516-520.
    • (1995) Journal of the Operational Research Society , vol.46 , pp. 516-520
    • Drezner, Z.1    Erkut, E.2
  • 7
    • 0008336908 scopus 로고    scopus 로고
    • SNOPT: An SQP algorithm for large-scale constrained optimization
    • Department of Mathematics, University of California at San Diego
    • Gill, P.E., M.A. Saunders, and W. Murray. (1997). "SNOPT: An SQP Algorithm for Large-scale Constrained Optimization." Report NA 97-2, Department of Mathematics, University of California at San Diego.
    • (1997) Report NA 97 , vol.97 , Issue.2
    • Gill, P.E.1    Saunders, M.A.2    Murray, W.3
  • 10
    • 50049107306 scopus 로고    scopus 로고
    • Computer experiments
    • S. Ghosh and C.R. Rao (eds.), Elsevier Science, New York
    • Koehler, J.R. and A.B. Owen. (1996). "Computer Experiments." In S. Ghosh and C.R. Rao (eds.), Handbook of Statistics, Vol. 13, Elsevier Science, New York, pp. 261-308.
    • (1996) Handbook of Statistics , vol.13 , pp. 261-308
    • Koehler, J.R.1    Owen, A.B.2
  • 12
    • 84867958818 scopus 로고    scopus 로고
    • Packing equal circles in a square: II. a deterministic global optimization approach
    • to appear
    • Locatelli, M. and U. Raber. (2002). "Packing Equal Circles in a Square: II. A Deterministic Global Optimization Approach." Discrete Applied Mathematics (to appear).
    • (2002) Discrete Applied Mathematics
    • Locatelli, M.1    Raber, U.2
  • 13
    • 0018468345 scopus 로고
    • A comparison of three methods for selecting values of input variables in the analysis of output from a computer code
    • McKay, M., R. Beckman, and W. Conover. (1979). "A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code." Technometrics 21, 239-245.
    • (1979) Technometrics , vol.21 , pp. 239-245
    • McKay, M.1    Beckman, R.2    Conover, W.3
  • 15
    • 0003714659 scopus 로고
    • Society for Industrial and Applied Mathematics, Philadelphia. SoftwareGuide for updated information
    • Moré, J.J. and S.J. Wright. (1993). Optimization Software Guide. Society for Industrial and Applied Mathematics, Philadelphia. See http://www-fp.mcs.anl.gov/otc/Guide/ SoftwareGuide for updated information.
    • (1993) Optimization Software Guide
    • Moré, J.J.1    Wright, S.J.2
  • 17
    • 0000444881 scopus 로고
    • Orthogonal arrays for computer experiments, integration and visualization
    • Owen, A.B. (1992). "Orthogonal Arrays for Computer Experiments, Integration and Visualization." Statistica Sinica 2, 439-452.
    • (1992) Statistica Sinica , vol.2 , pp. 439-452
    • Owen, A.B.1
  • 18
    • 21844504222 scopus 로고
    • Lattice sampling revisited: Monte carlo variance of means over randomized orthogonal arrays
    • Owen, A.B. (1994). "Lattice Sampling Revisited: Monte Carlo Variance of Means over Randomized Orthogonal Arrays." Annals of Statistics 22, 930-945.
    • (1994) Annals of Statistics , vol.22 , pp. 930-945
    • Owen, A.B.1
  • 19
    • 84972517827 scopus 로고
    • Design and analysis of computer experiments
    • Includes discussion
    • Sacks, J., W.J. Welch, T.J. Mitchell, and H.P. Wynn. (1989). "Design and Analysis of Computer Experiments." Statistical Science 4, 409-435. Includes discussion.
    • (1989) Statistical Science , vol.4 , pp. 409-435
    • Sacks, J.1    Welch, W.J.2    Mitchell, T.J.3    Wynn, H.P.4


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