Implementation of Cutting Plane Separators for Mixed Integer ... - ZIB

Chapter 3, 4, and 5 form the main part of this thesis. Here, we address the
development of the cutting plane separators for the class of c-MIR inequalities, for
the 0-1 knapsack problem, and for the 0-1 single node flow problem. They are all
organized in a similar way. We always start with giving a literature review, then
we introduce the classes of valid inequalities which we want to separate. This is
followed by a discussion of different algorithmic aspects of the corresponding separation
algorithms. Here, we will also state the heuristics used by other researchers.
Finally, we present the results of our computational study concerning the effect of
the discussed algorithmic and implementation choices. The results will then be used
to develop our final cutting plane separators. At the end of each chapter, we state
some concluding remarks.
In Chapter 6, we briefly introduce three further cutting plane separators, namely
the cutting plane separators for the class of GMI inequalities, for the node packing
problem, and for the class of implied bound inequalities.
In Chapter 7, we present computational results concerning the comparison of our
cutting plane separators to the ones provided by other MIP solvers. Here, the cutting
plane separators are still applied basically isolated. Finally, we remove the isolated
application and evaluate the impact of the individual cutting plane separators on
the overall performance of Scip.
3