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

List of Tables
3.1 CPS for the class of c-MIR inequalities: Altering single algorithmic
aspects – Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
3.2 CPS for the class of c-MIR inequalities: Reducing the separation time
– Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38
3.3 CPS for the class of c-MIR inequalities: Reducing the separation time
– Summary (Remaining test set) . . . . . . . . . . . . . . . . . . . . 38
4.1 CPS for the 0-1 knapsack problem – LMCI1: Altering single algorithmic
aspects – Summary . . . . . . . . . . . . . . . . . . . . . . . . . 71
4.2 CPS for the 0-1 knapsack problem – LEWI: Altering single algorithmic
aspects – Summary . . . . . . . . . . . . . . . . . . . . . . . . . 74
4.3 CPS for the 0-1 knapsack problem – LMCI2: Altering single algorithmic
aspects – Summary . . . . . . . . . . . . . . . . . . . . . . . . . 78
4.4 CPS for the 0-1 knapsack problem: Different combination of LMCI1,
LEWI, and LMCI2 – Summary . . . . . . . . . . . . . . . . . . . . . 82
5.1 CPS for the 0-1 single node flow problem: Altering single algorithmic
aspects – Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101
5.2 CPS for the 0-1 single node flow problem: Reducing the separation
time – Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105
5.3 CPS for the 0-1 single node flow problem: Reducing the separation
time – Summary (Remaining test set) . . . . . . . . . . . . . . . . . 106
7.1 Impact of the overall performance of Scip: Enabling individual cutting
plane separators – Summary . . . . . . . . . . . . . . . . . . . . 122
7.2 Impact of the overall performance of Scip: Disabling individual cutting
plane separators – Summary . . . . . . . . . . . . . . . . . . . . 125
B.1 CPS for the class of c-MIR inequalities: Main test set . . . . . . . . 132
B.2 CPS for the class of c-MIR inequalities: Remaining test set . . . . . 133
B.3 CPS for the class of c-MIR inequalities: Default algorithm . . . . . . 135
B.4 CPS for the class of c-MIR inequalities: Aggregation heuristic (1) . . 137
B.5 CPS for the class of c-MIR inequalities: Aggregation heuristic (2) . . 139
B.6 CPS for the class of c-MIR inequalities: Bound subst. heuristic (1) . 141
B.7 CPS for the class of c-MIR inequalities: Bound subst. heuristic (2) . 143
B.8 CPS for the class of c-MIR inequalities: Bound subst. heuristic (3) . 145
B.9 CPS for the class of c-MIR inequalities: Bound subst. heuristic (4) . 147
B.10 CPS for the class of c-MIR inequalities: Bound subst. heuristic (5) . 149
ix