| Article ID: | iaor20053328 |
| Country: | China |
| Volume: | 40 |
| Issue: | 2 |
| Start Page Number: | 23 |
| End Page Number: | 24 |
| Publication Date: | Mar 2004 |
| Journal: | Journal of Northwest Normal University |
| Authors: | Huang Jingjing, Ling Yongxiang, Xu Fengmin |
The idea of rank two relaxation for max-cut problem is used for the quadratic knapsack problem, and the model of the rank two relaxation for the quadratic knapsack problem is obtained. The optimal solution to the relaxation is achieved by the penalty function method. Finally the optimal solution of the model is transformed into the solution of quadratic knapsack problem by the rounding algorithm.