A reactive tabu search algorithm with variable clustering for the unicost sec Covering problem
From MaRDI portal
Publication:1000167
DOI10.1504/IJOR.2007.012458zbMath1154.90581OpenAlexW2067557723MaRDI QIDQ1000167
Bruce W. Colletti, J. Wesley Barnes, Gary W. Kinney
Publication date: 5 February 2009
Published in: International Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijor.2007.012458
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
MLQCC: an improved local search algorithm for the set k‐covering problem ⋮ ConsNet -- a tabu search approach to the spatially coherent conservation area network design problem
This page was built for publication: A reactive tabu search algorithm with variable clustering for the unicost sec Covering problem
