scientific article; zbMATH DE number 1817784

MaRDI QIDQ3150896zbMATH OpenFDO

Authors Miklós Ujvári

Publication date 20 October 2002

zbMATH Keywords

graph-bisection problemsemidefinite duality theorem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Semi-infinite programming (90C34) Programming involving graphs or networks (90C35)

Recommendations

• Graph bisection revisited
• Solving Graph Bisection Problems with Semidefinite Programming
• On semidefinite programming relaxations of maximum \(k\)-section
• Nonpolyhedral Relaxations of Graph-Bisection Problems
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison

Cited in

(6)

• Some optimization problems on weak-bisplit graphs
• Graph bisection revisited
• Better Bounds for Graph Bisection
• On judicious bisections of graphs
• scientific article; zbMATH DE number 5237020 (Why is no real title available?)
• An exact combinatorial algorithm for minimum graph bisection

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 Q3150896)