A tabu search algorithm for the covering design problem

DOI10.1007/s10732-010-9150-2zbMath1237.90192OpenAlexW1972590396MaRDI QIDQ415558

Philippe Galinier, Kamal Fadlaoui

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)

Related Items (2)

Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ A tabu search algorithm for the covering design problem

Uses Software

• Tabu search

Cites Work

• A tabu search algorithm for the covering design problem
• Small covering designs by branch-and-cut
• Optimal covering designs: complexity results and new bounds
• Bounds on the sizes of constant weight covering codes
• A general approach for constraint solving by local search
• Diversification strategies in tabu search algorithms for the maximum clique problem
• On coverings
• New constructions for covering designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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