On the Enumeration of ‐Optimal and Minimax‐Optimal k‐Circulant Supersaturated Designs
From MaRDI portal
Publication:5414315
DOI10.1002/jcd.21341zbMath1286.05022OpenAlexW1789154498MaRDI QIDQ5414315
Publication date: 2 May 2014
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21341
computer searchsupersaturated designscyclic generators\(E(s^2)\)-optimalityminimax-optimality1-rotational resolvable balanced incomplete block designs
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Constructing \(E(s^2)\)-optimal and minimax-optimal \(k\)-circulant supersaturated designs via multi-objective tabu search
- Optimal \(k\)-circulant supersaturated designs
- Exploring \(k\)-circulant supersaturated designs via genetic algorithms
- Optimal mixed-level supersaturated design
- Construction of \(E(s^2)\) optimal supersaturated designs using cyclic BIBDs
- \(E(s^{2})\)-optimal supersaturated designs with good minimax properties
- \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing
- Minimax 16-run supersaturated designs
- Another Look at First-Order Saturated Designs: The p-Efficient Designs
- Some Systematic Supersaturated Designs
- A method for constructing supersaturated designs and its Es2 optimality
- Enumeration of resolvable 2‐(10, 5, 16) and 3‐(10, 5, 6) designs
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
This page was built for publication: On the Enumeration of ‐Optimal and Minimax‐Optimal k‐Circulant Supersaturated Designs