Journal
MATHEMATICAL PROGRAMMING
Volume 102, Issue 3, Pages 559-575Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-004-0550-7
Keywords
-
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available