A GRASP algorithm to solve the unicost set covering problem
From MaRDI portal
Recommendations
- Computing approximate solutions of the maximum covering problem with GRASP
- An improved configuration checking-based algorithm for the unicost set covering problem
- An approach to the solution of the set-covering problem
- scientific article; zbMATH DE number 7059774
- A heuristic algorithm for the set covering problem
- A unified approach to approximating partial covering problems
- A Unified Approach to Approximating Partial Covering Problems
- Uniform unweighted set cover: the power of non-oblivious local search
- A Heuristic Method for the Set Covering Problem
- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1114001 (Why is no real title available?)
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- scientific article; zbMATH DE number 956862 (Why is no real title available?)
- A 3-flip neighborhood local search for the set covering problem
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Heuristic Method for the Set Covering Problem
- A genetic algorithm for the set covering problem
- A parallel genetic algorithm to solve the set-covering problem
- A surrogate heuristic for set covering problems
- An adaptation of SH heuristic to the location set covering problem
- An annotated bibliography of GRASP-Part II: Applications
- Computational experience with approximation algorithms for the set covering problem
- Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
- Enhancing an algorithm for set covering problems
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Local search algorithms for SAT: an empirical evaluation
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- The Location of Emergency Service Facilities
Cited in
(16)- A new approach for solving set covering problem using jumping particle swarm optimization method
- The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory
- Using a greedy random adaptative search procedure to solve the cover printing problem
- Exploring further advantages in an alternative formulation for the set covering problem
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- Algorithms for computing minimal unsatisfiable subsets of constraints
- MLQCC: an improved local search algorithm for the set k‐covering problem
- An electromagnetism metaheuristic for the unicost set covering problem
- A hybrid heuristic for the set covering problem
- Effective heuristics for the set covering with pairs problem
- scientific article; zbMATH DE number 7059774 (Why is no real title available?)
- A mixed integer linear program and tabu search approach for the complementary edge covering problem
- Towards an efficient resolution of printing problems
- An efficient local search heuristic with row weighting for the unicost set covering problem
- SAT-Based Formula Simplification
- An improved configuration checking-based algorithm for the unicost set covering problem
This page was built for publication: A GRASP algorithm to solve the unicost set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878597)
