A binary monkey search algorithm variation for solving the set covering problem.
Broderick CrawfordRicardo SotoRodrigo OlivaresGabriel EmbryDiego FloresWenceslao PalmaCarlos CastroFernando ParedesJosé Miguel RubioPublished in: Nat. Comput. (2020)
Keyphrases
- set covering problem
- search algorithm
- set covering
- branch and bound algorithm
- column generation
- branch and bound
- integer programming
- bi objective
- combinatorial optimization
- integer program
- search procedure
- search problems
- optimization algorithm
- constraint programming
- linear program
- optimal solution
- heuristic search
- exact solution
- np complete
- distributed constraint satisfaction problems