Worst case analysis of a class of set covering heuristics
From MaRDI portal
Publication:3951908
DOI10.1007/BF01583786zbMath0489.90066MaRDI QIDQ3951908
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
Using a facility location algorithm to solve large set covering problems, Conditional covering: greedy heuristics and computational results, Pareto optimality and a class of set covering heuristics, Dominant, an algorithm for the \(p\)-center problem., Heuristic methods and applications: A categorized survey, Two new heuristics for the location set covering problem
Cites Work