Algorithms for finding generalized minimum aberration designs
From MaRDI portal
Publication:2349095
DOI10.1016/j.jco.2014.12.001zbMath1320.62188arXiv2104.12588OpenAlexW2023959613MaRDI QIDQ2349095
Dursun A. Bulutoglu, Kenneth J. Ryan
Publication date: 16 June 2015
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.12588
heuristic searchconstraint programmingisomorphism rejectiondirected enumeration constraintsextension algorithmnauty
Optimal statistical designs (62K05) Integer programming (90C10) Factorial statistical designs (62K15)
Related Items
Construction of generalized minimum aberration three-level orthogonal arrays with three, four and five columns, Uniform semi-Latin squares and their pairwise-variance aberrations, On Construction of Nonregular Two-Level Factorial Designs With Maximum Generalized Resolutions, Construction of minimum generalized aberration two-level orthogonal arrays
Uses Software
Cites Work
- Unnamed Item
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
- An algorithmic approach to finding factorial designs with generalized minimum aberration
- Orthogonal arrays with variable numbers of symbols
- Pruning by isomorphism in branch-and-cut
- Small covering designs by branch-and-cut
- Exploiting orbits in symmetric ILP
- Minimum \(G_2\)-aberration for nonregular fractional factorial designs
- Minimum \(G_{2}\)-aberration properties of two-level foldover designs
- Generalized minimum aberration for asymmetrical fractional factorial designs.
- Improved WLP and GWP lower bounds based on exact integer programming
- Practical graph isomorphism. II.
- An effective algorithm for generation of factorial designs with generalized minimum aberration
- Exact solutions to linear programming problems
- Symmetric ILP: Coloring and small integers
- Classification of orthogonal arrays by integer programming
- Minimum aberration construction results for nonregular two-level fractional factorial designs
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Universal Optimality of Fractional Factorial Plans Derivable Through Orthogonal Arrays
- Some nonregular designs from the Nordstrom–Robinson code and their statistical properties
