A tabu search algorithm for the covering design problem
From MaRDI portal
Publication:415558
DOI10.1007/S10732-010-9150-2zbMATH Open1237.90192OpenAlexW1972590396MaRDI QIDQ415558FDOQ415558
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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- The CRC handbook of combinatorial designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Diversification strategies in tabu search algorithms for the maximum clique problem
- On coverings
- 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
- New constructions of Lotto designs
- Title not available (Why is that?)
- New constructions for covering designs
Cited In (6)
- Small covering designs by branch-and-cut
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
- A multilevel cooperative tabu search algorithm for the covering design problem
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
- A tabu search algorithm for the covering design problem
- A tabu search algorithm for the bipartite drawing problem
Uses Software
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)
