1 citations · 3 across the 9 of their papers we have counts for
12 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…
Agentic MIP Research: Accelerated Constraint Handler Generation
Liding Xu, Yugeng Zhou, Sebastian Pokutta
Mixed-integer programming (MIP) research is both mathematically sophisticated and engineering-intensive: testing an algorithmic hypothesis within a branch-and-cut solver requires s…
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…
Relaxations for binary polynomial optimization via signed certificates
Liding Xu, Leo Liberti
We consider the problem of minimizing a polynomial over the (binary) hypercube. We show that, for a specific set of polynomials, their binary non-negativity (i.e. on the hyperc…
Formulations of the continuous set-covering problem on networks: a comparative study
Liding Xu, Claudia D'Ambrosio
We study the continuous set covering problem on networks and propose several new MILP formulations and valid inequalities. In contrast to state-of-the-art formulations, the new for…
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…
Submodular maximization and its generalization through an intersection cut lens
Liding Xu, Leo Liberti
We study a mixed-integer set arising in the submodular maximization problem, where is a submodular function defined o…
Cutting planes for signomial programming
Liding Xu, Claudia D'Ambrosio, Leo Liberti +1
Cutting planes are of crucial importance when solving nonconvex nonlinear programs to global optimality, for example using the spatial branch-and-bound algorithms. In this paper, w…
Branch and Price for Submodular Bin Packing
Liding Xu, Claudia D'Ambrosio, Sonia Haddad Vanier +1
The Submodular Bin Packing (SMBP) problem asks for packing unsplittable items into a minimal number of bins for which the capacity utilization function is submodular. SMBP is equiv…
Continuous Covering on Networks: Improved Mixed Integer Programming Formulations
Mercedes Pelegrín, Liding Xu
Covering problems are well-studied in the domain of Operations Research, and, more specifically, in Location Science. When the location space is a network, the most frequent assump…