Optimization algorithms and cyclic designs
From MaRDI portal
Publication:1976886
DOI10.1007/BF01220296zbMath0960.05015OpenAlexW2066819058MaRDI QIDQ1976886
Publication date: 10 May 2001
Published in: Journal of Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01220296
Cites Work
- On the existence of super-simple designs with block size 4
- New upper bounds on the minimum size of covering designs
- Super-simple designs with \(v\leq 32\)
- On the number of mutually disjoint cyclic designs and large sets of designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimization algorithms and cyclic designs