TY - GEN A1 - Berthold, Timo T1 - RENS - Relaxation Enforced Neighborhood Search N2 - In the recent years, a couple of quite successful large neighborhood search heuristics for mixed integer programs has been published. Up to our knowledge, all of them are improvement heuristics. We present a new start heuristic for general MIPs working in the spirit of large neighborhood search. It constructs a sub-MIP which represents the space of all feasible roundings of some fractional point - normally the optimum of the LP-relaxation of the original MIP. Thereby, one is able to determine whether a point can be rounded to a feasible solution and which is the best possible rounding. Furthermore, a slightly modified version of RENS proves to be a well-performing heuristic inside the branch-cut-and-price-framework SCIP. KW - mixed integer programming KW - primal heuristics KW - large neighborhood search Y1 - 2009 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/593 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-5933 ER -