Improved WLP and GWP lower bounds based on exact integer programming
From MaRDI portal
Publication:2266886
DOI10.1016/j.jspi.2009.10.013zbMath1181.90198MaRDI QIDQ2266886
Dursun A. Bulutoglu, David M. Kaziska
Publication date: 26 February 2010
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2009.10.013
fractional factorial designs; generalized minimum aberration; minimum aberration; weak minimum aberration; exact integer programming
Related Items
Construction of minimum generalized aberration two-level orthogonal arrays, Algorithms for finding generalized minimum aberration designs, A search of maximum generalized resolution quaternary-code designs via integer linear programming, Iterative Refinement for Linear Programming
Cites Work
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
- Some results on \(2^{n - m}\) designs of resolution IV with (weak) minimum aberration
- Orthogonal arrays. Theory and applications
- Generalized minimum aberration for asymmetrical fractional factorial designs.
- Results for two-level fractional factorial designs of resolution IV or more
- Exact solutions to linear programming problems
- Classification of orthogonal arrays by integer programming
- Doubling and projection: A method of constructing two-level designs of resolution IV
- 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
- Minimum Aberration 2 k-p Designs
- Some nonregular designs from the Nordstrom–Robinson code and their statistical properties
- Unnamed Item
- Unnamed Item
