A reactive tabu search algorithm with variable clustering for the unicost sec Covering problem

DOI10.1504/IJOR.2007.012458zbMATH Open1154.90581OpenAlexW2067557723MaRDI QIDQ1000167FDOQ1000167

Authors: Gary W. Kinney, J. W. Barnes, B. W. Colletti 

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

Mathematics Subject Classification ID

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

Cited In (2)

• ConsNet -- a tabu search approach to the spatially coherent conservation area network design problem
• MLQCC: an improved local search algorithm for the set k‐covering problem

This page was built for publication: A reactive tabu search algorithm with variable clustering for the unicost sec Covering problem

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