1. R. Aringhieri and M. Dell'Amico,A Variable-Neighborhood Variable-Objective Tabu Search Algorithm for the SONET Ring Assignment with Capacity Constraints. DISMI, Università di Modena e Reggio Emilia, 10 (2001).
2. N. Brauner, Y. Crama, P. Lemaire and C. Wynants,Complexité et approximation pour la conception de réseaux SONET/SDH.Technical Report 61, Les Cahiers du Laboratoire Leibniz-IMAG, (October 2002). http://www-leibniz.imag.fr/LesCahiers/
3. N. Brauner and P. Lemaire,A Set-Covering Approach for SONET Network Design.Technical Report 62, Les Cahiers du Laboratoire Leibniz-IMAG (October 2002). http://www-leibniz.imag.fr/LesCahiers/
4. A Greedy Heuristic for the Set-Covering Problem
5. ETSI. ETSI - Telecom Standards. http://www.etsi.org