Pages that link to "Item:Q2216956"
From MaRDI portal
The following pages link to On maximin distance and nearly orthogonal Latin hypercube designs (Q2216956):
Displaying 16 items.
- Completion of partial Latin hypercube designs: NP-completeness and inapproximability (Q683750) (← links)
- Two-dimensional minimax Latin hypercube designs (Q1003737) (← links)
- Finding maximin Latin hypercube designs by iterated local search heuristics (Q1014951) (← links)
- Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs (Q1990600) (← links)
- Maximin distance designs based on densest packings (Q2044761) (← links)
- Asymptotically optimal maximin distance Latin hypercube designs (Q2124784) (← links)
- Optimal maximin \(L_2\)-distance Latin hypercube designs (Q2301107) (← links)
- Bounds for Maximin Latin Hypercube Designs (Q3100370) (← links)
- Maximin Latin Hypercube Designs in Two Dimensions (Q3392065) (← links)
- Construction of Maximin Distance Designs via Level Permutation and Expansion (Q4571214) (← links)
- A theorem for selecting oa-based latin hypercubes using a distance criterion (Q4843704) (← links)
- Interleaved lattice-based maximin distance designs (Q4973626) (← links)
- Construction of maximin distance Latin squares and related Latin hypercube designs (Q5384482) (← links)
- On the connection between maximin distance designs and orthogonal designs (Q5384599) (← links)
- A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs (Q6080787) (← links)
- New bounds and search for maximin distance U-type designs (Q6548922) (← links)
