A tabu search algorithm for the covering design problem

DOI10.1007/S10732-010-9150-2MaRDI QIDQ415558zbMATH OpenOpenAlexFDO

Authors Kamal Fadlaoui, P. Galinier

Publication date 8 May 2012

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10732-010-9150-2

zbMATH Keywords

metaheuristicstabu searchcovering design

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• New coverings oft-sets with (t + 1)-sets
• A multilevel cooperative tabu search algorithm for the covering design problem
• Covering \(t\)-sets with \((t+2)\)-sets
• New constructions for covering designs
• Upper bounds for covering arrays by tabu search.

Cites work

• scientific article; zbMATH DE number 124521 (Why is no real title available?)
• scientific article; zbMATH DE number 1265079 (Why is no real title available?)
• scientific article; zbMATH DE number 637340 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• A general approach for constraint solving by local search
• A tabu search algorithm for the covering design problem
• Bounds on the sizes of constant weight covering codes
• Diversification strategies in tabu search algorithms for the maximum clique problem
• New constructions for covering designs
• New constructions of Lotto designs
• On coverings
• Optimal covering designs: complexity results and new bounds
• Small covering designs by branch-and-cut
• The CRC handbook of combinatorial designs

Cited in

(8)

• Small covering designs by branch-and-cut
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
• MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
• A tabu search algorithm for the bipartite drawing problem
• Variable neighborhood descent heuristic for covering design problem
• A tabu search algorithm for the covering design problem
• A large neighbourhood search heuristic for covering designs
• A multilevel cooperative tabu search algorithm for the covering design problem

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: A tabu search algorithm for the covering design problem

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