The first approximation algorithm for the maximin Latin hypercube design problem
From MaRDI portal
Recommendations
- Completion of partial Latin hypercube designs: NP-completeness and inapproximability
- Bounds for maximin Latin hypercube designs
- Finding maximin Latin hypercube designs by iterated local search heuristics
- An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design
- An algorithm for fast optimal Latin hypercube design of experiments
Cites work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A study on algorithms for optimization of Latin hypercubes
- An efficient algorithm for constructing optimal design of computer experiments
- Bounds for maximin Latin hypercube designs
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Efficient global optimization of expensive black-box functions
- Exploratory designs for computational experiments
- Finding maximin Latin hypercube designs by iterated local search heuristics
- Kriging metamodeling in simulation: a review
- Maximin Latin Hypercube Designs in Two Dimensions
Cited in
(7)- Finding maximin Latin hypercube designs by iterated local search heuristics
- Bandits help simulated annealing to complete a maximin Latin hypercube design
- Screening: from tornado diagrams to effective dimensions
- Kriging: methods and applications
- Extracting optimal datasets for metamodelling and perspectives for incremental samplings
- Completion of partial Latin hypercube designs: NP-completeness and inapproximability
- The optimization of space-filling and orthogonality for Latin hypercube design using a local search-based NSGA-II
This page was built for publication: The first approximation algorithm for the maximin Latin hypercube design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969322)
