MIP Solving: Primal Heuristics
Автор: Mixed Integer Programming
Загружено: 2024-09-18
Просмотров: 470
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 primal heuristics. We will introduce various ideas to try to quickly generate an ad-hoc solution for a mixed-integer program without an exhaustive search. We will also discuss the orchestration of such heuristic algorithms.
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
![Как происходит модернизация остаточных соединений [mHC]](https://image.4k-video.ru/id-video/jYn_1PpRzxI)
