Design of Matheuristics for Optimization Problems
The search space of combinatorial problems grow exponentially with the increase in the size of the problem instance. Then, the exact optimization techniques have difficulties to solve large problems. On the other hand, the heuristics can find feasible solutions to large problems, however, do not guarantee optimality. In this paper, we suggest the use of hybrid algorithms that blend into issues of the exact and heuristic approaches to solve combinatorial optimization problems.