Now showing items 1-2 of 2
A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming
We present a branch and cut algorithm that yields in finite time, a globally epsilon-optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem. ...
Concavity Cuts for Disjoint Bilinear Programming
We pursue the study of concavity cuts for the disjoint bilinear programming problem. This optimization problem has two equivalent symmetric linear maxmin reformulations, leading to two sets of concavity cuts. We first ...