New heuristics for the conditional covering problem
From MaRDI portal
Recommendations
- Conditional covering: greedy heuristics and computational results
- Efficient algorithms for the conditional covering problem
- New heuristic algorithms for the rectangular $p$-cover problem
- A New Efficient Heuristic for the Minimum Set Covering Problem
- A new worst-case bound of heuristic for set covering problem
- Two new heuristics for the location set covering problem
- Algorithms for solving the conditional covering problem on paths
- scientific article; zbMATH DE number 800301
- A hybrid heuristic for the set covering problem
- A Heuristic Method for the Set Covering Problem
Cited in
(12)- Conditional covering: greedy heuristics and computational results
- New heuristic algorithms for the rectangular $p$-cover problem
- Fuzzy covering problem of fuzzy graphs and its application to investigate the Indian economy in new normal
- Ad hoc heuristic for the cover printing problem
- Covering problem on fuzzy graphs and its application in disaster management system
- Fast heuristics for large scale covering-location problems
- An efficient algorithm to solve the conditional covering problem on trapezoid graphs
- Efficient algorithms for the conditional covering problem
- The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
- Heuristic approaches to the capacitated square covering problem
- Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
- Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
This page was built for publication: New heuristics for the conditional covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365766)
