Exact and heuristic approaches for the set cover with pairs problem
✍ Scribed by Luciana Brugiolo Gonçalves; Simone de Lima Martins; Luiz Satoru Ochi; Anand Subramanian
- Book ID
- 113085776
- Publisher
- Springer-Verlag
- Year
- 2011
- Tongue
- English
- Weight
- 223 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1862-4472
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper a simple Lagrangian heuristic is proposed for the set covering problem. It is based on simple and classica1 ideas: Lagrangian duality, greedy heuristic for the set covering problem, subgradient optimization and redundant covers. The main interesting point of the paper lies in the fact
We present a theoretical analysis and an experimental evaluation of four serial heuristics and four parallel heuristics for the minimum set cover problem. The serial heuristics trade off run time with the quality of the solution. The parallel heuristics are derived from one of the serial heuristics.