메뉴 건너뛰기




Volumn 46, Issue 2, 2010, Pages 287-306

One-dimensional nested maximin designs

Author keywords

Computer simulation; Global optimization; Linking parameter; Maximin design; Mixed integer linear programming; Packing problem; Space filling; Training and test set

Indexed keywords

LINKING PARAMETER; MAXIMIN; MIXED INTEGER LINEAR PROGRAMMING; PACKING PROBLEMS; SPACE-FILLING; TEST SETS;

EID: 77949272258     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-009-9426-y     Document Type: Article
Times cited : (21)

References (26)
  • 3
    • 0037118767 scopus 로고    scopus 로고
    • Optimizing color picture tubes by high-cost nonlinear programming
    • DOI 10.1016/S0377-2217(02)00063-2, PII S0377221702000632
    • D. den Hertog H.P. Stehouwer 2002 Optimizing color picture tubes by high-cost nonlinear programming Euro. J. Oper. Res. 140 2 197 211 10.1016/S0377-2217(02)00063-2 (Pubitemid 34435027)
    • (2002) European Journal of Operational Research , vol.140 , Issue.2 , pp. 197-211
    • Den Hertog, D.1    Stehouwer, P.2
  • 4
    • 0003302793 scopus 로고
    • D.-Z. Du P.M. Pardalos (eds). Kluwer Dordrecht
    • -1995 Minimax and Applications D.-Z. Du P.M. Pardalos (eds). Kluwer Dordrecht
    • (1995) Minimax and Applications
  • 5
    • 3042619612 scopus 로고    scopus 로고
    • Dense packings of equal spheres in a cube
    • Th. Gensane 2004 Dense packings of equal spheres in a cube Elect. J. Comb. 11 R33
    • (2004) Elect. J. Comb. , vol.11 , pp. 33
    • Gensane, Th.1
  • 6
    • 0031284208 scopus 로고    scopus 로고
    • An example of simulation optimisation using a neural network metamodel: Finding the optimum number of kanbans in a manufacturing system
    • 10.1057/palgrave.jors.2600468
    • R.D. Hurrion 1997 An example of simulation optimisation using a neural network metamodel: finding the optimum number of kanbans in a manufacturing system J. Oper. Res. Soc. 48 11 1105 1112 10.1057/palgrave.jors.2600468
    • (1997) J. Oper. Res. Soc. , vol.48 , Issue.11 , pp. 1105-1112
    • Hurrion, R.D.1
  • 9
    • 0000561424 scopus 로고    scopus 로고
    • Efficient global optimization of expensive black-box functions
    • 10.1023/A:1008306431147
    • D. Jones M. Schonlau W.J. Welch 1998 Efficient global optimization of expensive black-box functions J. Glob. Optim. 13 455 492 10.1023/A:1008306431147
    • (1998) J. Glob. Optim. , vol.13 , pp. 455-492
    • Jones, D.1    Schonlau, M.2    Welch, W.J.3
  • 10
    • 3242803554 scopus 로고    scopus 로고
    • Application-driven sequential designs for simulation experiments: Kriging metamodelling
    • 10.1057/palgrave.jors.2601747
    • J.P.C. Kleijnen W.C.M. van Beers 2004 Application-driven sequential designs for simulation experiments: Kriging metamodelling J. Oper. Res. Soc. 55 8 876 883 10.1057/palgrave.jors.2601747
    • (2004) J. Oper. Res. Soc. , vol.55 , Issue.8 , pp. 876-883
    • Kleijnen, J.P.C.1    Van Beers, W.C.M.2
  • 11
    • 0000625923 scopus 로고
    • New results in the packing of equal circles in a square
    • 10.1016/0012-365X(93)E0230-2
    • C. Maranas C. Floudas P.M. Pardalos 1995 New results in the packing of equal circles in a square Discret. Math. 142 287 293 10.1016/0012-365X(93)E0230- 2
    • (1995) Discret. Math. , vol.142 , pp. 287-293
    • Maranas, C.1    Floudas, C.2    Pardalos, P.M.3
  • 13
    • 0003098328 scopus 로고
    • Exploratory designs for computer experiments
    • 10.1016/0378-3758(94)00035-T
    • M.D. Morris T.J. Mitchell 1995 Exploratory designs for computer experiments J. Stat. Plan. Inference 43 381 402 10.1016/0378-3758(94)00035-T
    • (1995) J. Stat. Plan. Inference , vol.43 , pp. 381-402
    • Morris, M.D.1    Mitchell, T.J.2
  • 14
    • 0032794467 scopus 로고    scopus 로고
    • Response surface methodology-current status and future directions
    • R.H. Myers 1999 Response surface methodology-current status and future directions J. Qual. Technol. 31 30 74
    • (1999) J. Qual. Technol. , vol.31 , pp. 30-74
    • Myers, R.H.1
  • 15
    • 0039270158 scopus 로고    scopus 로고
    • Packing up to 50 equal circles in a square
    • 10.1007/PL00009306
    • K.J. Nurmela P.R.J. Östergård 1997 Packing up to 50 equal circles in a square Discret. Comput. Geom. 18 111 120 10.1007/PL00009306
    • (1997) Discret. Comput. Geom. , vol.18 , pp. 111-120
    • Nurmela, K.J.1    Östergård, P.R.J.2
  • 16
    • 0039253425 scopus 로고    scopus 로고
    • More optimal packings of equal circles in a square
    • 10.1007/PL00009472
    • K.J. Nurmela P.R.J. Östergård 1999 More optimal packings of equal circles in a square Discret. Comput. Geom. 22 439 547 10.1007/PL00009472
    • (1999) Discret. Comput. Geom. , vol.22 , pp. 439-547
    • Nurmela, K.J.1    Östergård, P.R.J.2
  • 18
    • 0035568189 scopus 로고    scopus 로고
    • Globally optimized spherical point arrangements: model variants and illustrative results
    • DOI 10.1023/A:1013107507150
    • J.D. Pintér 2001 Globally optimized spherical point arrangements: model variants and illustrative results Ann. Oper. Res. 104 213 230 10.1023/A:1013107507150 (Pubitemid 33634431)
    • (2001) Annals of Operations Research , vol.104 , Issue.1-4 , pp. 213-230
    • Pinter, J.D.1
  • 19
    • 44649160575 scopus 로고    scopus 로고
    • Solving circle packing problems by global optimization: Numerical results and industrial applications
    • DOI 10.1016/j.ejor.2007.01.054, PII S0377221707004274
    • J.D. Pintér F.J. Kampas I. Castillo 2008 Solving circle packing problems by global optimization: numerical results and industrial applications Euro. J. Oper. Res. 191 786 802 10.1016/j.ejor.2007.01.054 (Pubitemid 351778615)
    • (2008) European Journal of Operational Research , vol.191 , Issue.3 , pp. 786-802
    • Castillo, I.1    Kampas, F.J.2    Pinter, J.D.3
  • 21
    • 84972517827 scopus 로고
    • Design and analysis of computer experiments
    • 10.1214/ss/1177012413
    • J. Sacks W.J. Welch T.J. Mitchell H.P. Wynn 1989 Design and analysis of computer experiments Stat. Sci. 4 409 435 10.1214/ss/1177012413
    • (1989) Stat. Sci. , vol.4 , pp. 409-435
    • Sacks, J.1    Welch, W.J.2    Mitchell, T.J.3    Wynn, H.P.4
  • 23
    • 0035336208 scopus 로고    scopus 로고
    • Finding elliptic Fekete points sets: Two numerical solution approaches
    • W.J.H. Stortelder J.J.B. de Swart J.D. Pintér 2001 Finding elliptic Fekete points sets: two numerical solution approaches Comput. Appl. Math. 130 1-2 205 216
    • (2001) Comput. Appl. Math. , vol.130 , Issue.12 , pp. 205-216
    • Stortelder, W.J.H.1    De Swart, J.J.B.2    Pintér, J.D.3
  • 24
    • 27944482383 scopus 로고    scopus 로고
    • Applying neural network and scatter search to optimize parameter design with dynamic characteristics
    • DOI 10.1057/palgrave.jors.2601888, PII 2601888
    • C.T. Su M.C. Chen H.L. Chan 2005 Applying neural network and scatter search to optimize parameter design with dynamic characteristics J. Oper. Res. Soc. 56 10 1132 1140 10.1057/palgrave.jors.2601888 (Pubitemid 43090708)
    • (2005) Journal of the Operational Research Society , vol.56 , Issue.10 , pp. 1132-1140
    • Su, C.-T.1    Chen, M.-C.2    Chan, H.-L.3
  • 25
    • 34247501855 scopus 로고    scopus 로고
    • Maximin Latin hypercube designs in two dimensions
    • DOI 10.1287/opre.1060.0317
    • E.R. van Dam B.G.M. Husslage D. den Hertog J.B.M. Melissen 2007 Maximin Latin hypercube designs in two dimensions Oper. Res. 55 158 169 10.1287/opre.1060.0317 (Pubitemid 46663480)
    • (2007) Operations Research , vol.55 , Issue.1 , pp. 158-169
    • Van Dam, E.R.1    Husslage, B.2    Den Hertog, D.3    Melissen, H.4
  • 26
    • 68149157936 scopus 로고    scopus 로고
    • Bounds for maximin Latin hypercube designs
    • (to appear)
    • van Dam, E.R., Husslage, B.G.M., Rennen, G.: Bounds for maximin Latin hypercube designs. Oper. Res. 57 (2009) (to appear)
    • (2009) Oper. Res. , vol.57
    • Van Dam, E.R.1    Husslage, B.G.M.2    Rennen, G.3


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