3 papers
math.OC2025
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…
math.OC2024
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…
math.OC2023
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…