1. Ahuja, R. K., Magnati, T. L., & Orlin, J. B. (1993). Network flows. Englewood Cliffs: Prentice-Hall.
2. Ali, A. A., & Lepage, F. (2007). IGMPS, a new tool for estimating end-to-end available bandwidth in IP network paths. In International conference on networking and services (pp. 115–120). Los Alamitos: IEEE Computer Society.
3. Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2007). The traveling salesman problem: A computational study. Princeton: Princeton University Press.
4. Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling: Applying constraint programming to scheduling problems. Norwell: Kluwer.
5. Biondi, P., & Desclaux, F. (2006). Silver needle in the Skype, 2006. Presentation at Black Hat Europe 2006.