Hybrid heuristics for minimum cardinality set covering problems

This publication has 12 references indexed in Scilit:

• Approximation algorithms for combinatorial problems
  Published by Elsevier ,2007
• An efficient heuristic for large set covering problems
  Naval Research Logistics Quarterly, 1984
• Worst case analysis of a class of set covering heuristics
  Mathematical Programming, 1982
• Efficient heuristic algorithms for the weighted set covering problem
  Computers & Operations Research, 1981
• Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications
  Networks, 1981
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
  Published by Springer Nature ,1980
• A Greedy Heuristic for the Set-Covering Problem
  Mathematics of Operations Research, 1979
• An Algorithm for Large Set Partitioning Problems
  Management Science, 1974
• Set Covering by an All Integer Algorithm
  Journal of the ACM, 1973
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972