Construction of maximin distance Latin squares and related Latin hypercube designs
From MaRDI portal
(Redirected from Publication:5384482)
Recommendations
- On maximin distance and nearly orthogonal Latin hypercube designs
- Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
- Optimal maximin \(L_2\)-distance Latin hypercube designs
- Asymptotically optimal maximin distance Latin hypercube designs
- Construction of maximin distance designs via level permutation and expansion
Cited in
(26)- Uniform projection designs
- Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
- Maximin distance designs based on densest packings
- Connecting U-type designs before and after level permutations and expansions
- Asymptotically optimal maximin distance Latin hypercube designs
- On maximin distance and nearly orthogonal Latin hypercube designs
- Optimal maximin \(L_2\)-distance Latin hypercube designs
- Construction of uniform projection designs via level permutation and expansion
- EzGP: Easy-to-Interpret Gaussian Process Models for Computer Experiments with Both Quantitative and Qualitative Factors
- On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments
- Modeling and Active Learning for Experiments with Quantitative-Sequence Factors
- Construction of maximin L₁-distance Latin hypercube designs
- New bounds and search for maximin distance U-type designs
- Construction of high-dimensional high-separation distance designs
- An integer programming algorithm for constructing maximin distance designs from good lattice point sets
- Column expanded Latin hypercube designs
- Construction of Two-Level Nonregular Designs of Strength Three With Large Run Sizes
- Application of kriging models for a drug combination experiment on lung cancer
- Strong orthogonal Latin hypercubes for computer experiments
- A construction method for maximin \(L_1\)-distance Latin hypercube designs
- Completion of partial Latin hypercube designs: NP-completeness and inapproximability
- A class of mixed-level amplified designs and their space-filling properties
- Space-filling properties of strong orthogonal arrays
- Constructing orthogonal maximin distance uniform projection designs for computer experiments
- Metaheuristic Solutions to Order-of-Addition Design Problems
- Musings on constructions of optimal Latin hypercube designs with flexible sizes
This page was built for publication: Construction of maximin distance Latin squares and related Latin hypercube designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384482)