Login / Signup
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem.
Michael Armbruster
Marzena Fügenschuh
Christoph Helmberg
Alexander Martin
Published in:
IPCO (2008)
Keyphrases
</>
semidefinite
high dimensional
computationally intensive
convex sets