A Bit-Parallel Tabu Search Algorithm for Finding Es2-Optimal and Minimax-Optimal Supersaturated Designs
We prove the equivalence of two-symbol supersaturated designs (SSDs) with N (even) rows, m columns, and smax=4t+i, where i∈0,2 and t∈ℤ≥0 and resolvable incomplete block designs (RIBDs) whose any two blocks intersect in at most N+4t+i/4 points. Using this equivalence, we formulate the search for two-...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-01-01
|
| Series: | Computational and Mathematical Methods |
| Online Access: | http://dx.doi.org/10.1155/2023/9431476 |