## Undercover – a primal heuristic for MINLP based on sub-MIPs generated by set covering

Please always quote using this URN: urn:nbn:de:0297-zib-11632
• We present Undercover, a primal heuristic for mixed-integer nonlinear programming (MINLP). The heuristic constructs a mixed-integer linear subproblem (sub-MIP) of a given MINLP by fixing a subset of the variables. We solve a set covering problem to identify a minimal set of variables which need to be fixed in order to linearise each constraint. Subsequently, these variables are fixed to approximate values, e.g. obtained from a linear outer approximation. The resulting sub-MIP is solved by a mixed-integer linear programming solver. Each feasible solution of the sub-MIP corresponds to a feasible solution of the original problem. Although general in nature, the heuristic seems most promising for mixed-integer quadratically constrained programmes (MIQCPs). We present computational results on a general test set of MIQCPs selected from the MINLPLib.

• Rev. vers. April 2010

• Original vers.

• Rev. vers. April 2010

• Original vers.

• Rev. vers. February 2012

• Rev. vers. February 2012

$Rev: 13581$