1. A. Aggarwal, H. Imai, N. Katoh and S. Suri, Findingk points with minimum diameter and related problems,J. Algorithms 12 (1991) 38–56.
2. H.J. Bandelt and A.W.M. Dress, Weak hierarchies associated with similarity measures: An additive clustering technique,Bulletin Mathematical Biology 51 (1989) 133–166.
3. F. Barahona, M. Junger and G. Reinelt, Experiments in quadratic 0–1 programming,Mathematical Programming 44 (1989) 127–137.
4. C. Barnhart, E.L. Johnson, G.L. Nemhauser and M.W.P. Savelsbergh, Branch and price: Column generation for solving huge integer programs, Computational Optimization Center COC-94-03, Georgia Institute of Technology, Atlanta, 1994; revised 1995.
5. J.-P. Barthelemy and A. Guénoche,Les Arbres et les Représentations des Proximités (Masson, Paris, 1988); English translation:Trees and Proximity Relations (Wiley, Chichester, UK, 1991).