Abstract
In this paper, we design an eigenvalue decomposition based branch-and-bound algorithm for finding global solutions of quadratically constrained quadratic programming (QCQP) problems. The hardness o...
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
