A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming
Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation and yields a quadratic objective function with...
| Published in: | Journal of Applied Mathematics |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Online Access: | http://dx.doi.org/10.1155/2013/963563 |