An electromagnetism metaheuristic for the unicost set covering problem

DOI10.1016/j.ejor.2010.01.035zbMath1188.90218OpenAlexW2034107192MaRDI QIDQ976443

Zahra Naji-Azimi, Paolo Toth, Laura Galli

Publication date: 11 June 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.035

zbMATH Keywords

combinatorial optimizationunicost set covering problemelectromagnetism metaheuristic

Mathematics Subject Classification ID

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

Related Items (8)

An efficient local search heuristic with row weighting for the unicost set covering problem ⋮ The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic ⋮ CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ The set covering problem revisited: an empirical study of the value of dual information ⋮ On reserve and double covering problems for the sets with non-Euclidean metrics ⋮ A new approach for solving set covering problem using jumping particle swarm optimization method ⋮ Exploring further advantages in an alternative formulation for the set covering problem

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An effective and simple heuristic for the set covering problem
• A GRASP algorithm to solve the unicost set covering problem
• A genetic algorithm for the set covering problem
• Algorithms for railway crew management
• A parallel genetic algorithm to solve the set-covering problem
• An electromagnetism-like mechanism for global optimization
• An algorithm for set covering problem
• A 3-flip neighborhood local search for the set covering problem
• A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
• A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
• An indirect genetic algorithm for set covering problems
• A Heuristic Method for the Set Covering Problem
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Algorithms for the set covering problem

This page was built for publication: An electromagnetism metaheuristic for the unicost set covering problem