Small covering designs by branch-and-cut.
In: Mathematical Programming, Jg. 94 (2003), Heft 2/3, S. 207-220
Online
academicJournal
Zugriff:
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. [ABSTRACT FROM AUTHOR]
Copyright of Mathematical Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Titel: |
Small covering designs by branch-and-cut.
|
---|---|
Autor/in / Beteiligte Person: | Margot, François |
Link: | |
Zeitschrift: | Mathematical Programming, Jg. 94 (2003), Heft 2/3, S. 207-220 |
Veröffentlichung: | 2003 |
Medientyp: | academicJournal |
ISSN: | 0025-5610 (print) |
DOI: | 10.1007/s10107-002-0316-z |
Schlagwort: |
|
Sonstiges: |
|