New coverings oft-sets with (t + 1)-sets

DOI<217::AID-JCD5>3.0.CO;2-W 10.1002/(SICI)1520-6610(1999)7:3<217::AID-JCD5>3.0.CO;2-WzbMath0917.05020OpenAlexW2046280600MaRDI QIDQ4242743

Kari J. Nurmela, Patric R. J. Östergård

Publication date: 18 July 1999

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1999)7:3<217::aid-jcd5>3.0.co;2-w

zbMATH Keywords

automorphism groupcombinatorial optimizationtabu searchcovering design

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Related Items (3)

Upper bounds on the general covering numberC_λ(v,k,t,m) ⋮ Hierarchical models as marginals of hierarchical models ⋮ Variable neighborhood descent heuristic for covering design problem

Cites Work

• Unnamed Item
• Minimal coverings of pairs by triples
• Covering triples by quadruples: an asymptotic solution
• On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\)
• t-designs on hypergraphs
• Bounds on the sizes of constant weight covering codes
• What we know and what we do not know about Turán numbers
• On coverings
• Die 5-fach transitiven Gruppen von Mathieu
• A few new constant weight codes (Corresp.)
• Tabu Search—Part I
• Some New 5-Designs
• New constant weight codes from linear permutation groups
• New constructions for covering designs

This page was built for publication: New coverings oft-sets with (t + 1)-sets