Obtaining minimum-correlation Latin hypercube sampling plans using an IP-based heuristic (Q1908998)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Obtaining minimum-correlation Latin hypercube sampling plans using an IP-based heuristic |
scientific article; zbMATH DE number 853146
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Obtaining minimum-correlation Latin hypercube sampling plans using an IP-based heuristic |
scientific article; zbMATH DE number 853146 |
Statements
Obtaining minimum-correlation Latin hypercube sampling plans using an IP-based heuristic (English)
0 references
4 July 1996
0 references
assignment problem
0 references
distribution sampling
0 references
estimation
0 references
optimization
0 references
sensitivity analysis
0 references
Latin hypercube sampling
0 references
univariate population
0 references
computer-based model
0 references
permutation matrices
0 references
sum of correlations
0 references
0 references
0 references
0.8200538754463196
0 references
0.8064286708831787
0 references
