Maximin distance designs based on densest packings

DOI10.1007/s00184-020-00788-wzbMath1472.62125OpenAlexW3041131937MaRDI QIDQ2044761

Liuqing Yang, Yong-Dao Zhou, Min-Qian Liu

Publication date: 10 August 2021

Published in: Metrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00184-020-00788-w

zbMATH Keywords

rotationcolumn-orthogonalmirror-symmetricnon-collapsing design

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Factorial statistical designs (62K15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Maximin \(L_1\)-distance range-fixed level-augmented designs

Cites Work

• Unnamed Item
• Exploratory designs for computational experiments
• Algorithms for generating maximin Latin hypercube and orthogonal designs
• Design of computer experiments: space filling and beyond
• Finding maximin Latin hypercube designs by iterated local search heuristics
• The design and analysis of computer experiments.
• Algorithmic construction of optimal symmetric Latin hypercube designs.
• Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
• Space-filling Latin hypercube designs for computer experiments
• Permuting regular fractional factorial designs for screening quantitative factors
• A Finite Packing Problem
• Maximin Latin Hypercube Designs in Two Dimensions
• Space-filling properties of good lattice point sets
• Orthogonal Array-Based Latin Hypercubes
• Construction of Maximin Distance Designs via Level Permutation and Expansion
• Construction of maximin distance Latin squares and related Latin hypercube designs

This page was built for publication: Maximin distance designs based on densest packings