Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

104

Voted

MP
2008

76views more MP 2008»

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

15 years 2 months ago

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

Download dollar.biz.uiowa.edu

Samuel Burer, Dieter Vandenbussche

Real-time Traffic

MP 2008 |

claim paper

Related Content

» Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets

» Optimal Spectrum Sharing in MIMO Cognitive Radio Networks via Semidefinite Programming

» Code design for radar STAP via optimization theory

» Efficient Maximum Margin Clustering via Cutting Plane Algorithm

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	MP
Authors	Samuel Burer, Dieter Vandenbussche

Comments (0)