A GRASP algorithm to solve the unicost set covering problem
From MaRDI portal
Publication:878597
DOI10.1016/j.cor.2005.11.026zbMath1127.90053OpenAlexW2156557985MaRDI QIDQ878597
Joaquín Bautista, Jordi Pereira
Publication date: 26 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.026
Related Items (12)
SAT-Based Formula Simplification ⋮ An efficient local search heuristic with row weighting for the unicost set covering problem ⋮ A distance-limited continuous location-allocation problem for spatial planning of decentralized systems ⋮ MLQCC: an improved local search algorithm for the set k‐covering problem ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ Algorithms for computing minimal unsatisfiable subsets of constraints ⋮ A mixed integer linear program and tabu search approach for the complementary edge covering problem ⋮ An electromagnetism metaheuristic for the unicost set covering problem ⋮ A new approach for solving set covering problem using jumping particle swarm optimization method ⋮ Using a greedy random adaptative search procedure to solve the cover printing problem ⋮ The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory ⋮ Towards an efficient resolution of printing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enhancing an algorithm for set covering problems
- An adaptation of SH heuristic to the location set covering problem
- A genetic algorithm for the set covering problem
- Computational experience with approximation algorithms for the set covering problem
- A surrogate heuristic for set covering problems
- Local search algorithms for SAT: an empirical evaluation
- A parallel genetic algorithm to solve the set-covering problem
- Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
- A 3-flip neighborhood local search for the set covering problem
- An annotated bibliography of GRASP-Part II: Applications
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- A Heuristic Method for the Set Covering Problem
- The Location of Emergency Service Facilities
This page was built for publication: A GRASP algorithm to solve the unicost set covering problem
