Extending a CIP framework to solve MIQCPs

  • 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.

Export metadata

  • Export Bibtex

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Timo Berthold, Stefan Heinz, Stefan Vigerske
Editor:Jon Lee, Sven Leyffer
Document Type:In Collection
Parent Title (English):Mixed Integer Nonlinear Programming
Volume:154
First Page:427
Last Page:444
Series:The IMA Volumes in Mathematics and its Applications
Publisher:Springer
Year of first publication:2012
ISBN:978-1-4614-1927-3
Preprint:urn:nbn:de:0297-zib-11371

$Rev: 13581 $