scientific article; zbMATH DE number 1778391

MaRDI QIDQ4544107zbMATH OpenFDO

Authors Zehui Ge, Sanyang Liu, Hongwei Liu

Publication date 11 August 2002

zbMATH Keywords

circuit bisectionrelaxation conditionssemidefinite programmingtight

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial optimization (90C27)

Recommendations

• Graph bisection revisited
• scientific article; zbMATH DE number 5237020
• scientific article; zbMATH DE number 1560335
• A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison

Cited in

(1)

• Positive semidefinite relaxation and approximation algorithm for triple patterning lithography

This page was built for publication:

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