90C26 Nonconvex programming, global optimization
Refine
Document Type
- ZIB-Report (9)
- Doctoral Thesis (1)
Is part of the Bibliography
- no (10)
Keywords
Institute
- Mathematical Optimization (10) (remove)
We provide a computational study of the performance of a state-of-the-art solver for nonconvex mixed-integer quadratically constrained programs (MIQCPs). Since successful general-purpose solvers for large problem classes necessarily comprise a variety of algorithmic techniques, we focus especially on the impact of the individual solver components. The solver SCIP used for the experiments implements a branch-and-cut algorithm based on linear outer approximation to solve MIQCPs to global optimality. Our analysis is based on a set of 86 publicly available test instances.