Browsing Mathematics (Faculty of) by Subject "Quadratic Assignment Problem"
Now showing items 1-2 of 2
-
A Blueprint for Semidefinite Relaxations of Binary-Constrained Quadratic Programs Computing tight bounds on NP-hard problems using ADMM
(University of Waterloo, 2020-12-18)This thesis looks at the solution techniques of two NP-hard, large scale problems, the quadratic assignment problem, QAP, and the side chain positioning, SCP, problem. We summarize existing approaches from and look at the ... -
On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming
(University of Waterloo, 2007-05-18)Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound ...