期刊
DISCRETE APPLIED MATHEMATICS
卷 156, 期 18, 页码 3483-3493出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.dam.2008.02.009
关键词
Minimax designs; Latin hypercube designs; Circle coverings
资金
- Royal Netherlands Academy of Arts and Sciences
We investigate minimax Latin hypercuber designs in two dimensions for several distance measures. For the l(infinity)-distance we are able to construct minimax Latin hypercube designs of n points, and to determine the minimal covering radius, for all n. For the l(1)-distance we have a lower bound for the covering radius, and a construction of minimax Latin hypercube designs for (infinitely) many values of n. We conjecture that the obtained lower bound is attained, except for a few small (known) values of n. For the l(2)-distance we have generated minimax solutions up to n = 27 by an exhaustive search method. The latter Latin hypercube designs are included in the website www.spacefillingdesigns.nl. (C) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据