Constructing 1-rotational NRDFs through an optimization approach: new (46,9,8), (51,10,9) and (55,9,8)-NRBDs
From MaRDI portal
Publication:953843
DOI10.1016/J.JSPI.2008.05.017zbMath1284.62488OpenAlexW2102040828MaRDI QIDQ953843
Publication date: 6 November 2008
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2008.05.017
combinatorial optimizationdifference familiesnear resolvable block designsscatter and tabu search algorithms
Cites Work
- Advances in evolutionary computing. Theory and applications
- Constructions for rotational near resolvable block designs
- Tabu Search—Part I
- Existence results for near resolvable designs
- Constructing difference families through an optimization approach: Six new BIBDs
- Constructing cyclic PBIBD(2)s through an optimization approach: Thirty‐two new cyclic designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constructing 1-rotational NRDFs through an optimization approach: new (46,9,8), (51,10,9) and (55,9,8)-NRBDs