We present GALINI, an open source solver for nonconvex mixed-integer quadratically-constrained quadratic programs formulated with the Python algebraic modeling library Pyomo. GALINI uses Pyomo to represent optimization problems and leverages the existing library ecosystem to implement different parts of the solver. GALINI includes a generic branch \& bound algorithm that can be use develop new solvers. The GALINI branch \& cut algorithm can be extended at runtime with new: (i) cutting planes, (ii) branching strategies, (iii) node selection strategies, (iv) primal heuristics, and (v) relaxations. We present computational studies to show GALINI performs comparably to existing open source solvers.
View GALINI: An extensible mixed-integer quadratically-constrained optimization solver