Optimization algorithms and cyclic designs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3941553 (Why is no real title available?)
- scientific article; zbMATH DE number 89401 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 637277 (Why is no real title available?)
- scientific article; zbMATH DE number 1011080 (Why is no real title available?)
- scientific article; zbMATH DE number 749269 (Why is no real title available?)
- scientific article; zbMATH DE number 842000 (Why is no real title available?)
- Designs with maximally different blocks and \(v=15,16\)
- New upper bounds on the minimum size of covering designs
- On the existence of super-simple designs with block size 4
- On the number of mutually disjoint cyclic designs and large sets of designs
- Super-simple designs with \(v\leq 32\)
This page was built for publication: Optimization algorithms and cyclic designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1976886)