What is the best greedy-like heuristic for the weighted set covering problem?
Francis J. VaskoYun LuKenneth ZymaPublished in: Oper. Res. Lett. (2016)
Keyphrases
- set covering problem
- set covering
- branch and bound algorithm
- integer programming
- column generation
- bi objective
- search algorithm
- greedy algorithm
- dynamic programming
- lower bound
- branch and bound
- greedy heuristic
- genetic programming
- search space
- greedy search
- vehicle routing problem
- efficient solutions
- reinforcement learning
- linear programming
- multi objective