LP and SDP branch-and-cut algorithms for the minimum graph...

Mathematical Programming Computation 2012 / 09 Vol. 4; Iss. 3

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
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
4
Language:
english
DOI:
10.1007/s12532-012-0040-5
Date:
September, 2012
File:
PDF, 810 KB
english, 2012
Conversion to is in progress
Conversion to is failed