MATH  G.C. Silva, L.S. Ochi, and S.L. Martins. Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem. In C.C. Ribeiro and S.L. Martins, editors, Experimental and efficient algorithms, volume 0000 of Lecture Notes in Computer Science, pages 000-000. Springer, Berlin, 0000.  H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Mathematica Japonica, 00:000-000, 0000.MathSciNetMATH  I.H. Witten, E. Frank, and M.A. Hall. Data mining: Practical machine learning tools and techniques. Morgan Kaufmann, San Francisco, 0rd edition, 0000. © Springer Science+Business Media New York 0000  Mauricio G.C. Resende and Celso C. RibeiroOptimization by GRASP00.0000/000-0-0000-0000-0_0  # 0. 