Abstract
In this paper we study a class of nonconvex quadratically constrained quadratic programming problems generalized from relaxations of quadratic assignment problems. We show that each problem is polynomially solved. Strong duality holds if a redundant constraint is introduced. As an application, a new lower bound is proposed for the quadratic assignment problem.
| Original language | English |
|---|---|
| Pages (from-to) | 1803-1812 |
| Number of pages | 10 |
| Journal | Acta Mathematica Sinica, English Series |
| Volume | 27 |
| Issue number | 9 |
| DOIs | |
| State | Published - Sep 2011 |
Keywords
- Nonconvex programming
- polynomial solvability
- quadratic assignment problem
- quadratically constrained quadratic programming
- strong duality
Fingerprint
Dive into the research topics of 'Global optimization of a class of nonconvex quadratically constrained quadratic programming problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver