1. Armbruster, M.: Branch-and-Cut for a Semidefinite Relaxation of Large-Scale Minimum Bisection Problems. PhD thesis, Chemnitz University of Technology, Chemnitz (2007)
2. Armbruster M., Fügenschuh M., Helmberg C., Martin A.: A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds) Proceedings of the 13th International Integer Programming and Combinatorial Optimization Conference, vol. 5035 of Lecture Notes in Computer Science, pp. 112–124. Springer, (2008)
3. Barzilai J., Borwein J.M.: Two point step size gradient methods. IMA J. Numer. Anal. 8, 141–148 (1988)
4. Borchers B.: CSDP, A C library for semidefinite programming. Optim. Methods Softw. 11(1), 613–623 (1999)
5. Brunetta L., Conforti M., Rinaldi G.: A branch-and-cut algorithm for the equicut problem. Math. Program. 78, 243–263 (1997)