An effective and simple heuristic for the set covering problem
From MaRDI portal
Publication:853015
Recommendations
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- A heuristic algorithm for the set covering problem
- An efficient heuristic for large set covering problems
- An efficient local search heuristic with row weighting for the unicost set covering problem
- A Heuristic Method for the Set Covering Problem
Cites work
- scientific article; zbMATH DE number 3831680 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1175963 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- scientific article; zbMATH DE number 786170 (Why is no real title available?)
- scientific article; zbMATH DE number 790416 (Why is no real title available?)
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Greedy Heuristic for the Set-Covering Problem
- A Heuristic Method for the Set Covering Problem
- A Lagrangian-based heuristic for large-scale set covering problems
- A genetic algorithm for the set covering problem
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Algorithms for the set covering problem
- An algorithm for set covering problem
- An efficient heuristic for large set covering problems
- An efficient mean field approach to the set covering problem
- An indirect genetic algorithm for set covering problems
- Computational experience with approximation algorithms for the set covering problem
- Enhancing an algorithm for set covering problems
- Note: A local-search heuristic for large set-covering problems
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Randomized approximation of bounded multicovering problems
- Using experimental design to find effective parameter settings for heuristics
Cited in
(42)- A new approach for solving set covering problem using jumping particle swarm optimization method
- An efficient heuristic for large set covering problems
- A-priori upper bounds for the set covering problem
- The robust set covering problem with interval data
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- Application placement and backup service in computer clustering in software as a service (SaaS) networks
- Memory and learning in metaheuristics
- An optimal algorithm for variable knockout problems
- Ad hoc heuristic for the cover printing problem
- The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory
- A meta-raps for the early/tardy single machine scheduling problem
- scientific article; zbMATH DE number 4160470 (Why is no real title available?)
- Exploring further advantages in an alternative formulation for the set covering problem
- A self-adaptive biogeography-based algorithm to solve the set covering problem
- A generalized constructive algorithm using insertion-based heuristics
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- The set covering problem revisited: an empirical study of the value of dual information
- Variable and large neighborhood search to solve the multiobjective set covering problem
- A surrogate heuristic for set covering problems
- RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Simple Lagrangian heuristic for the set covering problem
- A variable neighborhood search algorithm for the multimode set covering problem
- An electromagnetism metaheuristic for the unicost set covering problem
- A hybrid heuristic for the set covering problem
- A set covering approach for multi-depot train driver scheduling
- Effective heuristics for the set covering with pairs problem
- Pick-and-choose heuristics for partial set covering
- Application of ant colony optimization metaheuristic on set covering problems
- A graph approach for fuzzy-rough feature selection
- An efficient local search heuristic with row weighting for the unicost set covering problem
- A meta-heuristic with orthogonal experiment for the set covering problem
- A new worst-case bound of heuristic for set covering problem
- Heuristic approaches to the capacitated square covering problem
- Solving the set covering problem with conflicts on sets: a new parallel GRASP
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
- Tactical fixed job scheduling with spread-time constraints
- A note on a symmetrical set covering problem: the lottery problem
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
- A metaheuristic framework for nonlinear capacitated covering problems
- Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems
This page was built for publication: An effective and simple heuristic for the set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853015)
