Obtaining minimum-correlation Latin hypercube sampling plans using an IP-based heuristic
DOI10.1007/BF01719258zbMATH Open0840.62060MaRDI QIDQ1908998FDOQ1908998
Authors: Carl M. Harris, Karla L. Hoffman, Leslie-Ann Yarrow 
Publication date: 4 July 1996
Published in: OR Spektrum (Search for Journal in Brave)
Recommendations
optimizationsensitivity analysisestimationLatin hypercube samplingassignment problempermutation matricesdistribution samplingcomputer-based modelsum of correlationsunivariate population
Multivariate analysis (62H99) Sampling theory, sample surveys (62D05) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Integer programming (90C10)
Cites Work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
- Small sample sensitivity analysis techniques for computer models.with an application to risk assessment
- A distribution-free approach to inducing rank correlation among input variables
- Facet identification for the symmetric traveling salesman polytope
- Controlling Correlations in Latin Hypercube Samples
- The Problem of Dimensionality in Stratified Sampling
Cited In (6)
- Using integer programming techniques for the solution of an experimental design problem
- Title not available (Why is that?)
- 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)
