1. Aringhieri, R., M. Dell’Amico, and L. Grasselli. (2001). “Solution of the Sonet Ring Assignment Problem with Capacity Constraints.” Technical Report 12, DISMI, University of Modena and Reggio Emilia.
2. Dell’Amico, M., A. Lodi, and F. Maffioli. (1999). “Solution of the Cumulative Assignment Problem with a Well-Structured Tabu Search Method.” Journal of Heuristics 5(2), 123–143.
3. Dell’Amico, M. and M. Trubian. (1998). “Solution of Large Weighted Equicut Problems.” European J. Oper. Res. 106(2/3), 500–521.
4. Glover, F. (1997). “A Template for Scatter Search and Path Relinking.” In J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers (eds.), Lecture Notes in Computer Science, vol. 1363, pp. 13–54.
5. Glover, F. (1999). “Scatter Search and Path Relinking.” In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization, McGraw Hill, pp. 297–316.