Maximin Latin Hypercube Designs in Two Dimensions
From MaRDI portal
Publication:3392065
Recommendations
Cited in
(33)- Two-dimensional minimax Latin hypercube designs
- Finding maximin Latin hypercube designs by iterated local search heuristics
- A critical appraisal of design of experiments for uncertainty quantification
- Maximin distance designs based on densest packings
- Asymptotically optimal maximin distance Latin hypercube designs
- One-dimensional nested maximin designs
- Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments
- Space-filling Latin hypercube designs for computer experiments
- On a dispersion problem in grid labeling
- Passivity-preserving interpolation-based parameterized model order reduction of PEEC models based on scattered grids
- Design of optimal spacecraft‐asteroid formations through a hybrid global optimization approach
- An algorithm for fast optimal Latin hypercube design of experiments
- Hybrid Behavioral-Based Multiobjective Space Trajectory Optimization
- Subset selection from large datasets for kriging modeling
- Nested maximin Latin hypercube designs
- Inverse modelling of an aneurysm's stiffness using surrogate-based optimization and fluid-structure interaction simulations
- Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization
- The first approximation algorithm for the maximin Latin hypercube design problem
- A fast optimal Latin hypercube design method using an improved translational propagation algorithm
- A literature review on circle and sphere packing problems: models and methodologies
- A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs
- A surrogate-assisted evolutionary algorithm with clustering-based sampling for high-dimensional expensive blackbox optimization
- 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
- Maximin design on non hypercube domains and kernel interpolation
- A heuristic algorithm with multi-scale perturbations for point arrangement and equal circle packing in a convex container
- A class of space-filling designs and their projection properties
- Optimizing Latin hypercube designs by particle swarm
- A hybrid multiagent approach for global trajectory optimization
- Efficiently packing unequal disks in a circle
- Orthogonal-column Latin hypercube designs with small samples
This page was built for publication: Maximin Latin Hypercube Designs in Two Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392065)
