The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic

DOI10.1007/978-3-319-18167-7_19zbMath1370.90208MaRDI QIDQ5357751

Broderick Crawford, Ricardo L. Soto, Fernando Paredes, Wenceslao Palma, Franklin Johnson, Enrique Norero

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18167-7_19

zbMATH Keywords

metaheuristics; set covering problem; ant colony optimization

Mathematics Subject Classification ID

90C10: Integer programming

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

90C09: Boolean programming

Uses Software

• OR-Library