A Beam-Search Approach to the Set Covering Problem.
Víctor ReyesIgnacio ArayaBroderick CrawfordRicardo SotoEduardo OlguínPublished in: CSOC (1) (2016)
Keyphrases
- beam search
- set covering problem
- branch and bound
- branch and bound algorithm
- column generation
- set covering
- search algorithm
- integer programming
- lower bound
- heuristic search
- bi objective
- search methods
- upper bound
- search space
- optimal solution
- production planning and scheduling
- test problems
- combinatorial optimization
- precedence constraints
- ranking functions
- search problems
- constraint programming
- linear programming
- hill climbing
- search strategies