Solving large set covering problems on a personal computer

DOI10.1016/0305-0548(88)90004-4zbMath0635.90069OpenAlexW2048561128MaRDI QIDQ1097839

Francis J. Vasko, Floyd E. Wolf

Publication date: 1988

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(88)90004-4

zbMATH Keywords

heuristicset coveringNP-complete

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

A column generation approach to job grouping for flexible manufacturing systems ⋮ A surrogate heuristic for set covering problems ⋮ Surrogate constraint normalization for the set covering problem ⋮ Algorithms for large scale set covering problems

Cites Work

• Unnamed Item
• Using a facility location algorithm to solve large set covering problems
• An efficient heuristic for large set covering problems
• Hybrid heuristics for minimum cardinality set covering problems
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Greedy Heuristic for the Set-Covering Problem
• Computer Solutions to Minimum-Cover Problems