论文信息 - Small covering designs by branch-and-cut

Small covering designs by branch-and-cut

Abstract. A Branch-and-Cut algorithm for finding covering designs is presented. Its originality resides in the use of isomorphism pruning of the enumeration tree. A proof that no 4-(10, 5, 1)-covering design with less than 51 sets exists is obtained together with all non isomorphic 4-(10, 5, 1)-covering designs with 51 sets.

François Margot | F. Margot

[1] Kari J. Nurmela,et al. New coverings of t-sets with (t+1)-sets , 1999 .

[2] Petteri Kaski,et al. ISOMORPH-FREE EXHAUSTIVE GENERATION OF COMBINATORIAL DESIGNS , 2002 .

[3] R. Read. Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations , 1978 .