BCAM Seminar Open issues in the solution of combinatorial optimization problems by means of heuristics algorithms

The dramatic increase in the computational power of computers has changed the way in which combinatorial optimization problems are currently solved. The classic operations research algorithms have given way to a new class of algorithms called heuristics. These algorithms are able to approximately solve practical optimization problems by using a limited amount of computational resources. However, in spite of their practical success, they lack the theoretical foundations of typical optimization algorithms. In this talk I will present heuristic algorithms and discuss the relevant mathematical questions. I will also elaborate on the field of heuristics with some recently carried out work in the analysis of phasetransition in combinatorial optimization.