7 citations · 16 across the 10 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.OC2026
The Strength of Root Cuts in an Extended Abstract Branch-and-Cut Model
Boyang Han, Aleksandr M. Kazachkov
The branch-and-cut paradigm has led to effective solvers for a wide range of mathematical optimization problems. Despite significant theoretical work on pure branching and pure cut…
math.OC2026
Chvátal-Gomory Rounding of Eigenvector Inequalities for QCQPs
Santanu S. Dey, Nan Jiang, Aleksandr Kazachkov +2
We introduce and analyze a class of valid inequalities for nonconvex quadratically constrained optimization problems (QCQPs) which we call Eigen-CG inequalities. These inequalities…