A multilevel cooperative tabu search algorithm for the covering design problem

MaRDI QIDQ3635560zbMATH OpenFDO

Authors Chaoying Dai, Michel Toulouse, P. C. Li

Publication date 6 July 2009

zbMATH Keywords

covering design problemssearch algorithmtabu search algorithm

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Searching and sorting (68P10)

Recommendations

• A tabu search algorithm for the covering design problem
• A large neighbourhood search heuristic for covering designs
• scientific article; zbMATH DE number 637340
• Covering \(t\)-sets with \((t+2)\)-sets
• Optimal covering designs: complexity results and new bounds

Cited in

(5)

• Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
• Variable neighborhood descent heuristic for covering design problem
• Parallel solution methods for vehicle routing problems
• A tabu search algorithm for the covering design problem
• A large neighbourhood search heuristic for covering designs

This page was built for publication: A multilevel cooperative 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 Q3635560)