TY - CONF A1 - Chmiela, Antonia A1 - Muñoz, Gonzalo A1 - Serrano, Felipe T1 - On the implementation and strengthening of intersection cuts for QCQPs T2 - Integer Programming and Combinatorial Optimization: 22nd International Conference, IPCO 2021 N2 - The generation of strong linear inequalities for QCQPs has been recently tackled by a number of authors using the intersection cut paradigm - a highly studied tool in integer programming whose flexibility has triggered these renewed efforts in non-linear settings. In this work, we consider intersection cuts using the recently proposed construction of maximal quadratic-free sets. Using these sets, we derive closed-form formulas to compute intersection cuts which allow for quick cut-computations by simply plugging-in parameters associated to an arbitrary quadratic inequality being violated by a vertex of an LP relaxation. Additionally, we implement a cut-strengthening procedure that dates back to Glover and evaluate these techniques with extensive computational experiments. Y1 - 2021 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/8601 VL - 22 SP - 134 EP - 147 ER -