Variable neighborhood descent heuristic for covering design problem

DOI10.1016/j.endm.2012.10.026zbMath1268.90157OpenAlexW1997993928MaRDI QIDQ2840773

No author found.

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.026

zbMATH Keywords

variable neighborhood searchcovering design

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a packing and covering problem
• Covering \(t\)-sets with \((t+2)\)-sets
• Variable neighborhood search
• Small covering designs by branch-and-cut
• Asymptotically optimal covering designs
• On coverings
• New coverings oft-sets with (t + 1)-sets
• New constructions for covering designs

This page was built for publication: Variable neighborhood descent heuristic for covering design problem