, Volume 102, Issue 3, pp 559-575
Date: 01 Oct 2004

A branch-and-cut algorithm for nonconvex quadratic programs with box constraints

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


We present the implementation of a branch-and-cut algorithm for bound constrained nonconvex quadratic programs. We use a class of inequalities developed in [12] as cutting planes. We present various branching strategies and compare the algorithm to several other methods to demonstrate its effectiveness.