1. Aggarwal, A., Imai, H., Katoh, N., and Suri, S. (1991): Finding k Points with Minimum Diameter and Related Problems. Journal of Algorithms, 12, 38–56.
2. Arthanari, T.S., and Dodge, Y. (1981): Mathematical Programming in Statistics. Wiley, New York.
3. Balas, E., and Xue, J. (1993): Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring. Research Report [num] MSSR-590, Carnegie Mellon.
4. Bandelt, H.J., and Dress, A.W.M. (1989): Weak Hierarchies Associated with Similarity Measures: an Additive Clustering Technique. Bulletin of Mathematical Biology, 51, 133–166.
5. Beasley, J.E. (1985): A Note on Solving Large p-median Problems. European Journal of Operational Research, 21, 270–273.