Obtaining minimum-correlation Latin hypercube sampling plans using an IP-based heuristic (Q1908998): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:15, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Obtaining minimum-correlation Latin hypercube sampling plans using an IP-based heuristic |
scientific article |
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
