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

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

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

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

metaheuristicsset covering problemant colony optimization

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (1)

Exploring further advantages in an alternative formulation for the set covering problem

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• A hybrid soft computing approach for subset problems
• Using a facility location algorithm to solve large set covering problems
• An electromagnetism metaheuristic for the unicost set covering problem
• A genetic algorithm for the set covering problem
• A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
• A Lagrangian-based heuristic for large-scale set covering problems
• Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• A Greedy Heuristic for the Set-Covering Problem
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• A Heuristic Method for the Set Covering Problem

This page was built for publication: The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic