MIP Solving: Presolving
Автор: Mixed Integer Programming
Загружено: 2024-09-18
Просмотров: 402
State-of-the-art MIP solvers consist of a plethora of subroutines that take care of different aspects of the solution process and make the solver computationally efficient: presolving, cut generation and selection, primal heuristics, and dedicated node and variable selection rules (aka branching). The focus of all presentations today is to give an insight into strategies that are actually employed by solvers in practice to give an understanding of how such a solver works internally.
This presentation looks into presolving techniques. We will describe various techniques to tighten the problem formulation, reduce the search space, and improve the numerics of a given MIP model before starting the actual branch-and-bound search process.
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
