  T.F. Noronha and C.C. Ribeiro. Routing and wavelength assignment by partition coloring. European Journal of Operational Research, 000: 000-000, 0000.CrossRefMATH  L. Osborne and B. Gillett. A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA Journal on Computing, 0:000-000, 0000.CrossRefMATH  M.G.C. Resende. Computing approximate solutions of the maximum covering problem using GRASP. Journal of Heuristics, 0:000-000, 0000.CrossRefMATH  M.G.C. Resende and C.C. Ribeiro. A GRASP for graph planarization. Networks, 00:000-000, 0000.CrossRef0000-0000\(000000\)00%0A0<000%0A%0AAID-NET0>0.0.CO%0B0-E)MATH  M.G.C. Resende and C.C. Ribeiro. Graph planarization. In C. Floudas and P.M. Pardalos, editors, Encyclopedia of optimization, volume 0, pages 000-000. Kluwer Academic Publishers, Boston, 0000.  M.G.C. Resende, P.M. Pardalos, and Y. Li. Algorithm 000: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software, 00:000-000, 0000.CrossRefMATH  M.G.C. Resende, T.A. Feo, and S.H. Smith. Algorithm 000: Fortran subroutines for approximate solution of maximum independent set problems using GRASP. ACM Transactions on Mathematical Software, 00:000-000, 0000.CrossRefMATH  M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos. Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP. Discrete Applied Mathematics, 000:00-000, 0000.CrossRef00000-0)MATH  C.C. Ribeiro and M.G.C. Resende. Algorithm 000: Fortran subroutines for approximate solution of graph planarization problems using GRASP. ACM Transactions on Mathematical Software, 00:000-000, 0000.CrossRefMATH  C.C. Ribeiro and I. Rosseti. A parallel GRASP heuristic for the 0-path network design problem. In B. Monien and R. Feldmann, editors, Euro-Par 0000 Parallel Processing, volume 0000 of Lecture Notes in Computer Science, pages 000-000. Springer, Berlin, 0000.  C.C. Ribeiro and I. Rosseti. Efficient parallel cooperative implementations of GRASP heuristics. Parallel Computing, 00:00-00, 0000.MathSciNetCrossRef  C.C. Ribeiro and I. Rosseti. tttplots-compare: A perl program to compare time-to-target plots or general runtime distributions of randomized algorithms. Optimization Letters