TY - GEN
A1 - Berthold, Timo
T1 - RENS – the optimal rounding
N2 - This article introduces RENS, the relaxation enforced neighborhood search, a large neighborhood search algorithm for mixed integer nonlinear programming (MINLP) that uses a sub-MINLP to explore the set of feasible roundings of an optimal solution x' of a linear or nonlinear relaxation. The sub-MINLP is constructed by fixing integer variables x_j with x'_j in Z and bounding the remaining integer variables to x_j in {floor(x'_j), ceil(x'_j)}. We describe two different applications of RENS: as a standalone algorithm to compute an optimal rounding of the given starting solution and as a primal heuristic inside a complete MINLP solver.
We use the former to compare different kinds of relaxations and the impact of cutting planes on the roundability of the corresponding optimal solutions. We further utilize RENS to analyze the performance of three rounding heuristics implemented in the branch-cut-and-price framework SCIP. Finally, we study the impact of RENS when it is applied as a primal heuristic inside SCIP.
All experiments were performed on three publically available test sets of mixed integer linear programs (MIPs), mixed integer quadratically constrained programs (MIQCPs), and MINLPs, using solely software which is available in source code.
It turns out that for these problem classes 60% to 70% of the instances have roundable relaxation optima and that the success rate of RENS does not depend on the percentage of fractional variables. Last but not least, RENS applied as primal heuristic complements nicely with existing root node heuristics in SCIP and improves the overall performance.
T3 - ZIB-Report - 12-17
KW - Primal Heuristic
KW - Mixed-Integer Nonlinear Programming
KW - Large Neighborhood Search
KW - Mixed-Integer Quadratically Constrained Programming
KW - Mixed-Intger Programming
Y1 - 2012
UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/1520
UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-15203
SN - 1438-0064
ER -