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-...

Celý popis

Podrobná bibliografia

Vydané v:	Computational and mathematical methods Ročník 2023
Hlavní autori:	Morales, Luis B., Bulutoglu, Dursun A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Hindawi 2023 John Wiley & Sons, Inc Wiley
Predmet:	Algorithms Arrays Equivalence Lower bounds Minimax technique Search algorithms Tabu search
ISSN:	2577-7408, 2577-7408
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!