Variable neighborhood descent heuristic for covering design problem

DOI10.1016/J.ENDM.2012.10.026zbMATH Open1268.90157OpenAlexW1997993928MaRDI QIDQ2840773FDOQ2840773

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

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

zbMATH Keywords

variable neighborhood searchcovering design

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• On a packing and covering problem
• Variable neighborhood search
• Title not available (Why is that?)
• On coverings
• Small covering designs by branch-and-cut
• Title not available (Why is that?)
• New constructions for covering designs
• Covering \(t\)-sets with \((t+2)\)-sets
• New coverings oft-sets with (t + 1)-sets
• Asymptotically optimal covering designs
• A multilevel cooperative tabu search algorithm for the covering design problem

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)