An effective and simple heuristic for the set covering problem
From MaRDI portal
Publication:853015
DOI10.1016/j.ejor.2005.09.028zbMath1102.90048OpenAlexW1973727721MaRDI QIDQ853015
Gary E. Whitehouse, Guanghui Lan, Gail W. DePuy
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.028
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (25)
Variable and large neighborhood search to solve the multiobjective set covering problem ⋮ A-priori upper bounds for the set covering problem ⋮ Application of ant colony optimization metaheuristic on set covering problems ⋮ An efficient local search heuristic with row weighting for the unicost set covering problem ⋮ Design of a heuristic algorithm for the generalized multi-objective set covering problem ⋮ A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction ⋮ Tactical fixed job scheduling with spread-time constraints ⋮ A distance-limited continuous location-allocation problem for spatial planning of decentralized systems ⋮ A generalized constructive algorithm using insertion-based heuristics ⋮ Application placement and backup service in computer clustering in software as a service (SaaS) networks ⋮ The robust set covering problem with interval data ⋮ A hybrid heuristic for the set covering problem ⋮ A variable neighborhood search algorithm for the multimode set covering problem ⋮ Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities ⋮ Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems ⋮ A graph approach for fuzzy-rough feature selection ⋮ A note on a symmetrical set covering problem: the lottery problem ⋮ An electromagnetism metaheuristic for the unicost set covering problem ⋮ A Meta-RaPS for the early/tardy single machine scheduling problem ⋮ The set covering problem revisited: an empirical study of the value of dual information ⋮ A new approach for solving set covering problem using jumping particle swarm optimization method ⋮ A self-adaptive biogeography-based algorithm to solve the set covering problem ⋮ The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory ⋮ A set covering approach for multi-depot train driver scheduling ⋮ Memory and Learning in Metaheuristics
Uses Software
Cites Work
- Randomized approximation of bounded multicovering problems
- A probabilistic heuristic for a computationally difficult set covering problem
- Enhancing an algorithm for set covering problems
- A genetic algorithm for the set covering problem
- Computational experience with approximation algorithms for the set covering problem
- A Lagrangian-based heuristic for large-scale set covering problems
- An algorithm for set covering problem
- An efficient heuristic for large set covering problems
- 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 probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- An indirect genetic algorithm for set covering problems
- Note: A local-search heuristic for large set-covering problems
- A Heuristic Method for the Set Covering Problem
- Using experimental design to find effective parameter settings for heuristics
- Algorithms for the set covering problem
- An efficient mean field approach to the set covering problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An effective and simple heuristic for the set covering problem
