Obtaining minimum-correlation Latin hypercube sampling plans using an IP-based heuristic
From MaRDI portal
Recommendations
Cites work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A distribution-free approach to inducing rank correlation among input variables
- Controlling Correlations in Latin Hypercube Samples
- Facet identification for the symmetric traveling salesman polytope
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
- Small sample sensitivity analysis techniques for computer models.with an application to risk assessment
- The Problem of Dimensionality in Stratified Sampling
Cited in
(6)- Using integer programming techniques for the solution of an experimental design problem
- scientific article; zbMATH DE number 1943029 (Why is no real title available?)
- Follow-up experimental designs for computer models and physical processes
- Latin hypercube sampling with inequality constraints
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
This page was built for publication: Obtaining minimum-correlation Latin hypercube sampling plans using an IP-based heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908998)