A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem
From MaRDI portal
Publication:4601636
Recommendations
- Note: A local-search heuristic for large set-covering problems
- MLQCC: an improved local search algorithm for the set k‐covering problem
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
- An improved configuration checking-based algorithm for the unicost set covering problem
- Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- An efficient local search heuristic with row weighting for the unicost set covering problem
- A variable neighborhood search algorithm for the multimode set covering problem
- scientific article; zbMATH DE number 1559541
Cited in
(7)- An efficient heuristic algorithm for solving connected vertex cover problem
- An improved configuration checking-based algorithm for the unicost set covering problem
- Local search for diversified top-\(k\) clique search problem
- Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
- MLQCC: an improved local search algorithm for the set k‐covering problem
- An optimization method for characterizing two groups of data
- New heuristic approaches for maximum balanced biclique problem
This page was built for publication: A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601636)
