Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems

We propose a new generic framework for solving combinatorial optimization problems that can be modeled as a set covering problem. The proposed algorithmic framework combines metaheuristics with exact algorithms through a guiding mechanism based on diversification and intensification decisions. After...

Ausführliche Beschreibung