Variable neighborhood descent heuristic for covering design problem

DOI10.1016/J.ENDM.2012.10.026MaRDI QIDQ2840773zbMATH OpenOpenAlexFDO

Authors Nebojša Nikolić, Igor Grujičić, đorđe Dugošija

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)

Recommendations

• A large neighbourhood search heuristic for covering designs
• A tabu search algorithm for the covering design problem
• Variable Neighborhood Search
• scientific article; zbMATH DE number 1488097
• Developments of variable neighborhood search

Cites work

• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• scientific article; zbMATH DE number 637340 (Why is no real title available?)
• A multilevel cooperative tabu search algorithm for the covering design problem
• Asymptotically optimal covering designs
• Covering \(t\)-sets with \((t+2)\)-sets
• New constructions for covering designs
• New coverings oft-sets with (t + 1)-sets
• On a packing and covering problem
• On coverings
• Small covering designs by branch-and-cut
• Variable neighborhood search

Cited in

(2)

• A parallel variable neighborhood search for solving covering salesman problem
• A large neighbourhood search heuristic for covering designs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840773)