1. A. Agra and C. Requejo, “On the linking set problem,” Cadernos de Matemática, Universidade de Aveiro, CM07 (2007).
2. P. Avella, M. Boccia, C. D. Martino, G. Oliviero, and A. Sforza, “A decomposition approach for a very large scale optimal diversity management problem,” 4OR 3, No. 1, 23–37 (2005).
3. O. Briant, Étude Théorique et Numérique du Problème de la Gestion de la Diversité, PhD thesis, Institut National Polytechnique de Grenoble (2000).
4. O.Briant and D. Naddef, “The optimal diversity management problem,” Oper. Res., 52, No. 4, 515–526 (2004).
5. M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979).