Algorithms for Finding Generalized Minimum Aberration Designs
Document Type
Article
Publication Date
8-2015
Abstract
We develop two directed enumeration algorithms that call the integer programming with isomorphism pruning algorithm of Margot (2007) for the purpose of finding GMA arrays. Our results include 16 GMA arrays that were not previously in the literature, along with documentation of the efficiencies that made the required calculations possible within a reasonable budget of computer time.
Abstract excerpt © Elsevier
DOI
10.1016/j.jco.2014.12.001
Source Publication
Journal of Complexity
Recommended Citation
Bulutoglu, D. A., & Ryan, K. J. (2015). Algorithms for finding generalized minimum aberration designs. Journal of Complexity, 31(4), 577–589. https://doi.org/10.1016/j.jco.2014.12.001
COinS
Comments
The "Link to Full Text" button on this page loads the open access article version of record, hosted at Elsevier. The publisher retains permissions to re-use and distribute this article.