Bounds for maximin Latin hypercube designs
From MaRDI portal
Recommendations
- Optimal maximin \(L_2\)-distance Latin hypercube designs
- On maximin distance and nearly orthogonal Latin hypercube designs
- Orthogonal-maximin Latin hypercube designs
- A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs
- Two-dimensional minimax Latin hypercube designs
Cited in
(24)- Two-dimensional minimax Latin hypercube designs
- Finding maximin Latin hypercube designs by iterated local search heuristics
- Bandits help simulated annealing to complete a maximin Latin hypercube design
- Asymptotically optimal maximin distance Latin hypercube designs
- One-dimensional nested maximin designs
- Space-filling Latin hypercube designs for computer experiments
- Estimation of global minimum value of the optimality criteria for constructing optimal Latin hypercube designs
- Generating a maximally spaced set of bins to fill for high-dimensional space-filling Latin hypercube sampling
- Maximin Latin Hypercube Designs in Two Dimensions
- Orthogonal-maximin Latin hypercube designs
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints
- Nested maximin Latin hypercube designs
- Generating and improving orthogonal designs by using mixed integer programming
- The first approximation algorithm for the maximin Latin hypercube design problem
- A standardized distance-based index to assess the quality of space-filling designs
- New bounds and search for maximin distance U-type designs
- An integer programming algorithm for constructing maximin distance designs from good lattice point sets
- Modification of the Maximin and ϕp (Phi) Criteria to Achieve Statistically Uniform Distribution of Sampling Points
- Completion of partial Latin hypercube designs: NP-completeness and inapproximability
- Design of computer experiments: space filling and beyond
- Sequentially extending space-filling experimental designs by optimally permuting and stacking columns of the design matrix
- Construction of doubly coupled designs with desirable space-filling properties
- Optimizing Latin hypercube designs by particle swarm
- Orthogonal-column Latin hypercube designs with small samples
This page was built for publication: Bounds for maximin Latin hypercube designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100370)
