1. Applegate, D.L., Bixby, R.B., Chavátal, V., WJ, Cook: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
2. Baniasadi, P., Ejov, V., Filar, J.A., Haythorpe, M., Rossomakhine, S.: Deterministic, “Snakes and Ladders’’ Heuristic for the Hamiltonian cycle problem. Math. Prog. Comput. 6(1), 55–74 (2014)
3. Bonami, P., Forret, J.J.H., Laird, C., Lee, J., Margot, F., Wächter, A.: BONMIN: basic open-source nonlinear mixed integer programming (2006), http://www.coin-or.org/Bonmin
4. Bonami, P., Lee, J.: BONMIN user’s manual, (2006) https://svn.coin-or.org/svn/Bonmin/releases/0.1.4/Bonmin/doc/BONMIN_UsersManual.pdf
5. Chalaturnyk, A.: A fast algorithm for finding Hamilton cycles. Master Thesis, University of Manitoba (2008)