Article ID: | iaor1996315 |
Country: | Switzerland |
Volume: | 58 |
Issue: | 1 |
Start Page Number: | 243 |
End Page Number: | 260 |
Publication Date: | Jul 1995 |
Journal: | Annals of Operations Research |
Authors: | Harris Carl M., Hoffman Karla L., Yarrow Leslie-Ann |
Latin hypercube sampling is often used to estimate the distribution function of a complicated function of many random variables. In so doing, it is typically necessary to choose a permutation matrix which minimizes the correlation among the cells in the hypercube layout. This problem can be formulated as a generalized, multi-dimensional assignment problem. For the two-dimensional case, the authors provide a polynomial algorithm. For higher dimensions, they offer effective heuristic and bounding procedures.