Rank-Two Relaxation Heuristics for Max-Cut and Other Binary Quadratic Programs(2000)
|
Reviews
[Write a review of this article]
There are no reviews of this article
Notes for this articleintro to SDP relaxation for max-cut, rank-2 relaxation non-convex but efficient, references to Ising literature
application of max-cut to Ising ground-state problem
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
AbstractThe Goemans-Williamson randomized algorithm guarantees a high-quality approximation to the Max-Cut problem, but the cost associated with such an approximation can be excessively high for large-scale problems due to the need for solving an expensive semidefinite relaxation. In order to achieve better practical performance, we propose an alternative, rank-two relaxation and develop a specialized version of the Goemans-Williamson technique. The proposed approach leads to continuous optimization...
BibTeX record
RIS record