1. Berthold, T., Heinz, S., Lübbecke, M. E., Möhring, R. H., & Schulz, J. (2010). A constraint integer programming approach for resource-constrained project scheduling. In A. Lodi, M. Milano, & P. Toth (Eds.), Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (Vol. 6140, pp. 313–317). Lecture notes in computer science. Berlin: Springer.
2. Cun, B. L., & Roucairol, C. (1995). The PNN team: BOB: A unified platform for implementing branch-and-bound like algorithms. Rapports de Recherche 95/16, PRiSM.
3. Danna, E. (2008). Performance variability in mixed integer programming. In: Presentation, workshop on Mixed Integer Programming (MIP 2008), Columbia University, New York.
http://coral.ie.lehigh.edu/~jeff/mip-2008/talks/danna.pdf
.
4. Gamrath, G., Koch, T., Maher, S. J., Rehfeldt, D., & Shinano, Y. (2017). SCIP-Jack–a solver for stp and variants with parallelization extensions. Math. Program. Comput., 9(2), 231–296.
5. Gottwald, R. L., Maher, S. J., & Shinano, Y. (2016). Distributed domain propagation. ZIB-Report 16-71, Zuse Institute Berlin, Takustr. 7, 14195 Berlin; Leibniz international proceedings in informatics SEA 2017 (to appear).