Covering \(t\)-sets with \((t+2)\)-sets

DOI10.1016/S0166-218X(99)00090-6zbMath0935.05030OpenAlexW1972207399MaRDI QIDQ1302176

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

Publication date: 26 April 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00090-6

zbMATH Keywords

automorphism groupcombinatorial optimizationtabu searchcovering design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of packing and covering (05B40)

Related Items (3)

Upper bounds on the general covering numberC_λ(v,k,t,m) ⋮ Computational cost of the Fekete problem. I: The forces method on the 2-sphere ⋮ Variable neighborhood descent heuristic for covering design problem

This page was built for publication: Covering \(t\)-sets with \((t+2)\)-sets