Login / Signup
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison.
Michael Armbruster
Marzena Fügenschuh
Christoph Helmberg
Alexander Martin
Published in:
Math. Program. Comput. (2012)
Keyphrases
</>
graph theory
data structure
linear programming
combinatorial optimization
computational complexity
dynamic programming
worst case
optimization problems
structured data
connected components
directed graph
complexity analysis
cutting plane