| Ser. |
|
596
|
| Title |
|
Extending a CIP framework to solve MIQCPs
|
| Abstract |
|
This paper discusses how to build a solver for mixed integer quadratically constrained programs (MIQCPs) by extending a framework for constraint integer programming (CIP). The advantage of this approach is that we can utilize the full power of advanced MIP and CP technologies. In particular, this addresses the linear relaxation and the discrete components of the problem. For relaxation, we use an outer approximation generated by linearization of convex constraints and linear underestimation of nonconvex constraints. Further, we give an overview of the reformulation, separation, and propagation techniques that are used to handle the quadratic constraints efficiently.
We implemented these methods in the branch-cut-and-price framework SCIP. Computational experiments indicates the potential of the approach.
|
| Author(s) |
|
Timo Berthold, Stefan Heinz, Stefan Vigerske
|
| PS-File |
|
CIP4MIQCP.ps
|
| PDF-File |
|
CIP4MIQCP.pdf
|
| Reviewing Referee |
|
Prof. Dr. Dr. h.c. mult. Martin Grötschel |
| MSC |
|
90C11, 90C20, 90C26, 90C27, 90C57 |
| Projects |
|
B20 |
| Keywords |
|
mixed integer quadratically constrained programming, constraint
integer programming, branch-and-cut, convex relaxation, domain propagation, primal
heuristic, nonconvex
|
| Previously published |
|
ZIB-Report 09-23 |
| |
|
|
