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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: August 16, 2000 / Accepted: July 18, 2001 Published online: September 5, 2002
Rights and permissions
About this article
Cite this article
Margot, F. Small covering designs by branch-and-cut. Math. Program., Ser. B 94, 207–220 (2003). https://doi.org/10.1007/s10107-002-0316-z
Issue Date:
DOI: https://doi.org/10.1007/s10107-002-0316-z