A search of maximum generalized resolution quaternary-code designs via integer linear programming
From MaRDI portal
Publication:2631366
DOI10.1007/s11222-014-9496-7zbMath1342.62133OpenAlexW2084221036MaRDI QIDQ2631366
Tai-Chi Wang, Shu-Ching Lin, Frederick Kin Hing Phoa
Publication date: 29 July 2016
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-014-9496-7
optimizationinteger linear programmingexperimental designsgeneralized resolutionquaternary-code designs
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- One-eighth- and one-sixteenth-fraction quaternary code designs with high resolution
- A trigonometric approach to quaternary code designs with application to one-eighth and one-sixteenth fractions
- A code arithmetic approach for quaternary code designs and its application to \((1/64)\)th-fractions
- Quarter-fraction factorial designs constructed via quaternary codes
- Logic and integer programming
- A linear programming bound for orthogonal arrays with mixed levels
- Minimum \(G_2\)-aberration for nonregular fractional factorial designs
- Improved WLP and GWP lower bounds based on exact integer programming
- Some results on \(s^{n-k}\) fractional factorial designs with minimum aberration or optimal moments
- A complementary set theory for quaternary code designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A search of maximum generalized resolution quaternary-code designs via integer linear programming
