Advanced Search
DSpace@MIT

Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming

Research and Teaching Output of the MIT Community

Files in this item

Name Size Format Description
85844312.pdf 2.785Mb PDF Preview, non-printable (open to all)
85844312-MIT.pdf 2.781Mb PDF Full printable version (MIT only)

This item appears in the following Collection(s)

MIT-Mirage