A hybrid of max-min ant system and linear programming for the \(k\)-covering problem

DOI10.1016/j.cor.2016.06.006zbMath1349.90703OpenAlexW2429530424MaRDI QIDQ342539

Sameh Al-Shihabi

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.06.006

zbMATH Keywords

linear programminglocal searchhybrid heuristicsMAX-MIN ant systemmetahueristicsset k-covering problem

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

MLQCC: an improved local search algorithm for the set k‐covering problem

Cites Work

• A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
• Experiments with LAGRASP heuristic for set \(k\)-covering
• A fast approximation algorithm for the multicovering problem
• An indirect genetic algorithm for set covering problems

This page was built for publication: A hybrid of max-min ant system and linear programming for the \(k\)-covering problem