An electromagnetism metaheuristic for the unicost set covering problem
From MaRDI portal
Publication:976443
DOI10.1016/J.EJOR.2010.01.035zbMATH Open1188.90218OpenAlexW2034107192MaRDI QIDQ976443FDOQ976443
Authors: 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
Recommendations
- An effective and simple heuristic for the set covering problem
- A heuristic algorithm for the set covering problem
- Note: A local-search heuristic for large set-covering problems
- An efficient local search heuristic with row weighting for the unicost set covering problem
- A GRASP algorithm to solve the unicost set covering problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- A genetic algorithm for the set covering problem
- Algorithms for the set covering problem
- An effective and simple heuristic for the set covering problem
- An electromagnetism-like mechanism for global optimization
- Algorithms for railway crew management
- An algorithm for set covering problem
- A 3-flip neighborhood local search for the set covering problem
- 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)
- A GRASP algorithm to solve the unicost set covering problem
- A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
- An indirect genetic algorithm for set covering problems
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- A parallel genetic algorithm to solve the set-covering problem
- Title not available (Why is that?)
- Tabu search-based metaheuristic algorithm for large-scale set covering problems
- Introduction to electromagnetism algorithm for the examination timetabling problem and comparison of it with other metaheuristics
Cited In (9)
- A new approach for solving set covering problem using jumping particle swarm optimization method
- On reserve and double covering problems for the sets with non-Euclidean metrics
- 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
- An optimal algorithm for variable knockout problems
- Exploring further advantages in an alternative formulation for the set covering problem
- The set covering problem revisited: an empirical study of the value of dual information
Uses Software
This page was built for publication: An electromagnetism metaheuristic for the unicost set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976443)
