Optimization algorithms and cyclic designs

DOI10.1007/BF01220296MaRDI QIDQ1976886zbMATH OpenOpenAlexFDO

Authors Iliya Bluskov

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

zbMATH Keywords

cyclic designsoptimization algorithms

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorics in computer science (68R05)

Review text

Several algorithms used recently in the construction of cyclic 2-designs, super-simple designs and in studying the number of mutually disjoint cyclic designs, are described.

Cites work

• Designs with maximally different blocks and v=15,16
• 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?)
• 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)