Hybrid heuristics for minimum cardinality set covering problems
From MaRDI portal
Publication:3722268
DOI10.1002/nav.3800330207zbMath0592.90065OpenAlexW2038955892MaRDI QIDQ3722268
George R. Wilson, Francis J. Vasko
Publication date: 1986
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800330207
Numerical mathematical programming methods (65K05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09)
Related Items
Two new heuristics for the location set covering problem ⋮ Solving large set covering problems on a personal computer ⋮ A comparison of algorithm RS with algorithm OPTSOL70 ⋮ Bethlehem steel combines cutting stock and set covering to enhance customer service ⋮ Dominant, an algorithm for the \(p\)-center problem. ⋮ An adaptation of SH heuristic to the location set covering problem ⋮ The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory ⋮ A neural network for the minimum set covering problem
Cites Work
