||Jun 21, 2016
||Dr. Gregor Hendel, Zuse Institute Berlin
How to solve Integer Optimization Problems with SCIP
The general-purpose branch-and-cut solver SCIP is one of the fastest
noncommercial tools for solving integer optimization problems. Its
plugin-based system facilitates custom extensions for specific applications.
The goal of this talk is to provide users with a basic understanding of the
SCIP solving process and to illustrate some ways to tackle custom projects.
In the first part of this talk, I will give an overview of the solving
process of SCIP and the role of the different plugin types. I will introduce
the most important plugin types of SCIP with special focus on its available
primal heuristics. The second part deals with the customization of SCIP at
the example of the famous Traveling Salesman Problem. Three alternative
approaches to formulate and solve TSP's will be discussed and their particular
advantages will be highlighted: via the modeling language ZIMPL, the C/C++
callable library of SCIP, and the new Python interface.