1. Aarts, E., & Lenstra, J. K. (2003). Local search in combinatorial optimization. Princeton University Press.
2. Ambainis, A., Balodis, K., Ikaids, J., Kokainis, M., Prūsis, K., & Vihrovs, J. (2019). Quantum speedups for exponential-time programming algorithms. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1783–1793). https://doi.org/10.1137/1.9781611975482.107
3. Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. L. (2006). The traveling salesman problem: A computational study. Princeton University Press.
4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., & Protasi, M. (2013). Complexity and approximation: Combinatorial optimization problems and their approximability properties. Springer.
5. Corne, D. W., Dorigo, C. M., & Glover, F. (1999). New ideas in optimization. McGraw-Hill.