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.

8 Figures and Tables

Statistics

01020200920102011201220132014201520162017
Citations per Year

56 Citations

Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Berthold2009ExtendingAC, title={Extending a CIP framework to solve MIQCPs}, author={Timo Berthold and Stefan Heinz and Stefan Vigerske and SOLVE MIQCPS}, year={2009} }