Rank-Two Relaxation Heuristics for Max-Cut and Other Binary Quadratic Programs

Simple item page
dc.contributor.authorBurer, Samuelen_US
dc.contributor.authorMonteiro, Renatoen_US
dc.contributor.authorZhang, Yinen_US
dc.date.accessioned2018-06-18T17:48:15Zen_US
dc.date.available2018-06-18T17:48:15Zen_US
dc.date.issued2000-11en_US
dc.date.noteNovember 2000en_US
dc.description.abstractSemidefinite relaxation for certain discrete optimization problems involves replacing a vector-valued variable by a matrix-valued one, producing a convex program while increasing the number of variables by an order of magnitude. As useful as it is in theory, this approach encounters difficulty in practice as problem size increases. In this paper, we propose a rank-two relaxation approach and construct continuous optimization heuristics applicable to some binary quadratic programs, including primarily the Max-Cut problem but also others such as the Max-Bisection problem. A computer code based on our rank-two relaxation heuristics is compared with two state-of-the-art semidefinite programming codes. We will report some rather intriguing computational results on a large set of test problems and discuss their ramifications.en_US
dc.format.extent19 ppen_US
dc.identifier.citationBurer, Samuel, Monteiro, Renato and Zhang, Yin. "Rank-Two Relaxation Heuristics for Max-Cut and Other Binary Quadratic Programs." (2000) <a href="https://hdl.handle.net/1911/101959">https://hdl.handle.net/1911/101959</a>.en_US
dc.identifier.digitalTR00-33en_US
dc.identifier.urihttps://hdl.handle.net/1911/101959en_US
dc.language.isoengen_US
dc.titleRank-Two Relaxation Heuristics for Max-Cut and Other Binary Quadratic Programsen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR00-33.pdf
Size:
209.97 KB
Format:
Adobe Portable Document Format
Download
Collections
CMOR Technical Reports