1. Achterberg, T.: Constraint Integer Programming. PhD-thesis, Technische Universität Berlin, Verlag Dr. Hut, München (2008)
2. Achterberg, T.: SCIP 1.1.0. Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustr. 7, 14195 Berlin-Dahlem, Germany. http://scip.zib.de (2009)
3. Achterberg T., Koch T., Martin A.: Branching rules revisited. Oper. Res. Lett. 33, 42–54 (2005)
4. Armbruster, M.: Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems. PhD-thesis, Technische Universität Chemnitz, Chemnitz, Germany (2007)
5. 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.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 5035, pp. 112–124. IPCO 2008. Springer, Berlin (2008)