5 papers
Joint-Range Inequalities for Nonconvex QCQPs
Liding Xu, Sebastian Pokutta
We study cutting planes for nonconvex quadratically constrained quadratic programs (QCQPs) through a project-then-lift approach inspired by mixed-integer rounding (MIR) inequalitie…
The SCIP Optimization Suite 10.0
Christopher Hojny, Mathieu Besançon, Ksenia Bestuzheva +31
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This…
Convex semidefinite tensor optimization and quantum entanglement
Liding Xu, Ye-Chao Liu, Sebastian Pokutta
The cone of positive-semidefinite (PSD) matrices is fundamental in convex optimization, and we extend this notion to tensors, defining PSD tensors, which correspond to separable qu…
Sparsity-driven Aggregation of Mixed Integer Programs
Liding Xu, Gioni Mexi, Ksenia Bestuzheva
Cutting planes are crucial for the performance of branch-and-cut algorithms for solving mixed-integer programming (MIP) problems, and linear row aggregation has been successfully a…
The SCIP Optimization Suite 9.0
Suresh Bolusani, Mathieu Besançon, Ksenia Bestuzheva +28
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This…