Management Science · 1990 · 254 citations · 45 references
Natural SciencesMathematicsCombinatoricsOptimizationSet TheoryBranch And BoundCombinatorial OptimizationDiscrete OptimizationGreedy AlgorithmsHeuristic OptimizationLinear ProgrammingCombinatorial Optimization HeuristicsHeuristicsLower BoundsPartitioning ProblemsSet CoverSet Cover ProblemSet Covering ProblemSet Partitioning Problem
We present an algorithm for a mixed set covering/partitioning model that includes as special cases the well-known set covering problem and set partitioning problem. The novel feature of our algorithm is the use of continuous heuristics applied to the dual of the linear programming relaxation to provide lower bounds for a branch and bound algorithm. The heuristics are continuous adaptations of the well-known greedy and 3-opt methods that have been applied to a variety of combinatorial optimization problems. Our algorithm has outperformed the current best set covering algorithm of Balas and Ho (1980) by about a factor of 3, and appears to improve on the best existing set partitioning algorithm by more than an order of magnitude.
45
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
A Greedy Heuristic for the Set-Covering Problem
Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations