MLQCC: an improved local search algorithm for the set k‐covering problem
From MaRDI portal
Publication:6088120
DOI10.1111/itor.12614OpenAlexW2911237281MaRDI QIDQ6088120
Minghao Yin, Chenxi Li, Unnamed Author, Jiejiang Chen, Yiyuan Wang
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12614
Related Items
An improved configuration checking-based algorithm for the unicost set covering problem ⋮ SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
Cites Work
- Unnamed Item
- An efficient local search heuristic with row weighting for the unicost set covering problem
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Experiments with LAGRASP heuristic for set \(k\)-covering
- Using a facility location algorithm to solve large set covering problems
- Set multi-covering via inclusion-exclusion
- A GRASP algorithm to solve the unicost set covering problem
- Dynamic programming based algorithms for set multicover and multiset multicover problems
- A reactive tabu search algorithm with variable clustering for the unicost sec Covering problem
- Approximating the maximum vertex/edge weighted clique using local search
- An efficient local search framework for the minimum weighted vertex cover problem
- TTT plots: a perl program to create time-to-target plots
- A 3-flip neighborhood local search for the set covering problem
- Exact formulations for the minimum interference problem ink-connectedad hocwireless networks
- Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- Tabu Search—Part I
- A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem
- A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem
- Note: A local-search heuristic for large set-covering problems
- A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
