1. Al-Shihabi S (2004) Ants for sampling in the nested partition algorithm. In: Blum C, Roli A, Sampels M (eds) Proceedings of HM 2004 – first international workshop on hybrid metaheuristics, pp 11–18
2. Angel E, Bampis E (2005) A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem. Eur J Oper Res 162(1):281–289
3. Applegate DL, Bixby RE, Chvátal V, Cook WJ (1998) On the solution of the traveling salesman problem. Documenta Mathematica, Extra Volume ICM III:645–656
4. Applegate DL, Bixby RE, Chvátal V, Cook WJ (2007) The traveling salesman problem: a computational study. Princeton Series in Applied mathematics. Princeton University Press, Princeton
5. Barahona F, Anbil R (2000) The volume algorithm: producing primal solutions with a subgradient method. Math Program A 87(3):385–399