A feasible direction algorithm for max bisection via low-rank factorization

MaRDI QIDQ3516589zbMATH OpenFDO

Authors Xuewen Mu, Hongwei Liu, Sanyang Liu

Publication date 6 August 2008

zbMATH Keywords

feasible directionMax Bisection problemrandomized methodsemidefinite programming relaxation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 2245551
• scientific article; zbMATH DE number 5209784
• scientific article; zbMATH DE number 5060354
• scientific article; zbMATH DE number 2063458
• A .699-approximation algorithm for Max-Bisection.

Cited in

(2)

• A rank-two feasible direction algorithm for the binary quadratic programming
• scientific article; zbMATH DE number 2245551 (Why is no real title available?)

This page was built for publication: A feasible direction algorithm for max bisection via low-rank factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3516589)