Date of Original Version

6-2000

Type

Article

Abstract or Description

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

DOI

10.1007/s10107-002-0316-z

Share

COinS
 

Published In

Mathematical Programming (Ser. B) , 94, 207-220.