Refine
Year of publication
Document Type
- In Proceedings (20)
- ZIB-Report (17)
- Article (12)
- In Collection (2)
- Book chapter (1)
- Master's Thesis (1)
Keywords
- mixed integer programming (5)
- domain propagation (3)
- branch-and-bound (2)
- mixed-integer programming (2)
- primal heuristic (2)
- MINLP (1)
- MIPLIB (1)
- Mixed Integer Programming (1)
- Newton barrier method (1)
- Node merging (1)
Institute
- Mathematical Optimization Methods (53) (remove)
Hybrid Branching
(2009)
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.