An algorithmic construction of \(E(s^2)\)-optimal supersaturated designs

DOI10.1080/15598608.2011.10412034zbMathNoneOpenAlexW2006066088MaRDI QIDQ452516

Kalliopi Mylona, Christos Koukouvinos, Dimitris E. Simos

Publication date: 15 September 2012

Published in: Journal of Statistical Theory and Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15598608.2011.10412034

zbMATH Keywords

supersaturated designs

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Cites Work

• Unnamed Item
• On the construction of \(E(s^2)\)-optimal supersaturated designs
• A general construction of \(E(s^2)\)-optimal large supersaturated designs
• A general construction of \(E(s^2)\)-optimal supersaturated designs via supplementary difference sets
• Tabu search for covering arrays using permutation vectors
• A hybrid SAGA algorithm for the construction of \(E(s^2)\)-optimal cyclic supersaturated designs
• Exploring \(k\)-circulant supersaturated designs via genetic algorithms
• Construction of \(E(s^2)\) optimal supersaturated designs using cyclic BIBDs
• Future paths for integer programming and links to artificial intelligence
• Construction of \(E(s^2)\)-optimal supersaturated designs
• A new method in the construction of two-level supersaturated designs
• \(E(s^{2})\)-optimal supersaturated designs with good minimax properties
• Cyclicly constructed \(E(s^{2})\)-optimal supersaturated designs
• \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing
• E\((s^{2})\)-optimal supersaturated designs with good minimax properties when \(N\) is odd
• A General Method of Constructing E(s2)-Optimal Supersaturated Designs
• Upper bounds on the number of columns in supersaturated designs
• An Algorithmic Approach to Constructing Supersaturated Designs
• An Analysis for Unreplicated Fractional Factorials
• Some Systematic Supersaturated Designs
• Construction of supersaturated designs through partially aliased interactions
• A method for constructing supersaturated designs and its Es² optimality
• Supersaturated design including an orthogonal base
• Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
• Large supersaturated designs
• Generating Systematic Supersaturated Designs

This page was built for publication: An algorithmic construction of \(E(s^2)\)-optimal supersaturated designs