A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
From MaRDI portal
Publication:342539
DOI10.1016/j.cor.2016.06.006zbMath1349.90703OpenAlexW2429530424MaRDI QIDQ342539
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
linear programminglocal searchhybrid heuristicsMAX-MIN ant systemmetahueristicsset k-covering problem
Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
This page was built for publication: A hybrid of max-min ant system and linear programming for the \(k\)-covering problem