Pages that link to "Item:Q3100370"
From MaRDI portal
The following pages link to Bounds for Maximin Latin Hypercube Designs (Q3100370):
Displaying 12 items.
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints (Q367165) (← links)
- Nested maximin Latin hypercube designs (Q381446) (← links)
- Generating and improving orthogonal designs by using mixed integer programming (Q420882) (← links)
- A standardized distance-based index to assess the quality of space-filling designs (Q518233) (← links)
- Design of computer experiments: space filling and beyond (Q693293) (← links)
- Optimizing Latin hypercube designs by particle swarm (Q746308) (← links)
- Orthogonal-column Latin hypercube designs with small samples (Q961256) (← links)
- Two-dimensional minimax Latin hypercube designs (Q1003737) (← links)
- Asymptotically optimal maximin distance Latin hypercube designs (Q2124784) (← links)
- One-dimensional nested maximin designs (Q2269596) (← links)
- Space-filling Latin hypercube designs for computer experiments (Q2443402) (← links)
- The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem (Q4969322) (← links)
