A variable neighborhood search algorithm for the multimode set covering problem.
Fabio ColomboRoberto CordoneGuglielmo LulliPublished in: J. Glob. Optim. (2015)
Keyphrases
- set covering problem
- search algorithm
- set covering
- branch and bound
- branch and bound algorithm
- column generation
- integer programming
- bi objective
- heuristic search
- search space
- max sat
- random walk
- linear programming
- neural network
- constraint programming
- np hard
- efficient solutions
- multi objective
- graph search
- lower bound