A polyhedral study of nonconvex quadratic programs with box constraints
Mathematical Programming: Series A and B
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
Mathematical Programming: Series A and B
Solving Lift-and-Project Relaxations of Binary Integer Programs
SIAM Journal on Optimization
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B - Series B - Special Issue: Combinatorial Optimization and Integer Programming
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
SIAM Journal on Optimization
Hi-index | 0.00 |