Bounds for maximin latin hypercube designs

Operations Research

Volumn 57, Issue 3, 2009, Pages 595-608

  Van Dam, Edwin R ^a   Rennen, Gijs ^a   Husslage, Bart ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

Latin hypercube design; Maximin; Mixed integer; Simulation: design of experiments; Space filling

Indexed keywords

LATIN HYPERCUBE DESIGN; MAXIMIN; MIXED-INTEGER; SIMULATION: DESIGN OF EXPERIMENTS; SPACE-FILLING;

COMBINATORIAL OPTIMIZATION; COMPUTER SIMULATION LANGUAGES; DESIGN OF EXPERIMENTS; GEOMETRY; SYSTEMS ANALYSIS; TRAVELING SALESMAN PROBLEM;

INTEGER PROGRAMMING;

EID: 68149157936     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0604     Document Type: Article

References (25)

1. Baer, D. 1992. Punktverteilungen in würfeln beliebiger dimension bezüglich der maximum-norm. Wiss. Z Pädagog. Hochsch. Erfurt/ Mühlhausen, Mathematik-Naturwissenschaften Reihe 28 87-92.
2. Bermond, J. C, D. Sotteau. 1976. Graph decompositions and g-designs. C. St. J. A. Nash-Williams, J. Sheehan, eds. Proc. 5th British Combinatorial Conf. 1975, Utilitas Mathematica Publishers, Winnipeg, Manitoba, Canada, 53-72.
3. Bisschop, J., R. Entriken. 1993. AIMMS: The Modeling System. Paragon Decision Technology, Haarlem, The Netherlands.
4. Booker, A. J., J. E. Dennis, P. D. Frank, D. B. Serafini, V. Torczon, M. W. Trosset. 1999. A rigorous framework for optimization of expensive functions by surrogates. Structural Multidisciplinary Optim. 17(1) 1-13.
5. den Hertog, D., H. P. Stehouwer. 2002. Optimizing color picture tubes by high-cost nonlinear programming. Eur J. Oper Res. 140(2) 197-211.
6. Driessen, L. T. 2006. Simulation-based optimization for product and process design. Ph.D. thesis, CentER for Economic Research, Tilburg University, Tilburg, The Netherlands.
7. Heinrich, K. 1996. Graph decompositions and designs. C. J. Colbourn, J. H. Dinitz, eds. Handbook of Combinatorial Designs. CRC Press, Boca Raton, FL, 361-365.
8. Husslage, B. G. M. 2006. Maximin designs for computer experiments. Ph.D. thesis, CentER for Economic Research, Tilburg University, Tilburg, The Netherlands.
9. Husslage, B. G. M., G. Rennen, E. R. van Dam, D. den Hertog. 2006. Space-filling Latin hypercube designs for computer experiments. CentER Discussion Paper 2006-18, Tilburg University, Tilburg, The Netherlands.
10. Jin, R., W. Chen, A. Sudjianto. 2005. An efficient algorithm for constructing optimal design of computer experiments. J. Statist. Planning Inference 134(1) 268-287.
11. Johnson, M. E., L. M. Moore, D. Ylvisaker. 1990. Minimax and maximin distance designs. J. Statist. Planning Inference 26 131-148.
12. Jones, D., M. Schonlau, W. J. Welch. 1998. Efficient global optimization of expensive black-box functions. J. Global Optim. 13 455-492.
13. Montgomery, D. C. 1984. Design and Analysis of Experiments, 2nd ed. John Wiley & Sons, New York.
14. Morris, M. D., T. J. Mitchell. 1995. Exploratory designs for computer experiments. J. Statist. Planning Inference 43 381-402.
15. Myers, R. H. 1999. Response surface methodology-Current status and future directions. J. Quality Tech. 31 30-74.
16. Oler, N. 1961. A finite packing problem. Canadian Math. Bull. 4(2) 153-155.
17. Sacks, J., S. B. Schiller, W. J. Welch. 1989a. Designs for computer experiments. Technometrics 31 41-47.
18. Sacks, J., W. J. Welch, T. J. Mitchell, H. P. Wynn. 1989b. Design and analysis of computer experiments. Statist. Sci. 4 409-435.
19. Santner, Th. J., B. J. Williams, W. I. Notz. 2003. The Design and Analysis of Computer Experiments. Springer Series in Statistics, Springer-Verlag, New York.
20. Stinstra, E. 2006. The meta-model approach for simulation-based design optimization. Ph.D. thesis, CentER for Economic Research, Tilburg University, Tilburg, The Netherlands.
21. van Dam, E. R., B. G. M. Husslage, D. den Hertog, J. B. M. Melissen. 2007. Maximin Latin hypercube designs in two dimensions. Oper. Res. 55(1) 158-169.
22. Volgenant, A. 1990. Symmetric traveling salesman problems. Eur. J. Oper. Res. 49(1) 153-154.
23. Volgenant, A., R. Jonker. 1982. A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation. Eur. J. Oper. Res. 9 83-89.
24. Wilson, R. M. 1976. Decompositions of complete graphs into subgraphs isomorphic to a given graph. C. St. J. A. Nash-Williams, J. Sheehan, eds. Proc. 5th British Combinatorial Conf. 1975, Utilitas Mathemat-ica Publishers, Winnipeg, Manitoba, Canada, 647-659.
25. Ye, K. Q., W. Li, A. Sudjianto. 2000. Algorithmic construction of optimal symmetric Latin hypercube designs. J. Statist. Planning Inference 90(1) 145-159.