  S. Poljak and Z. Tuza. Maximum cuts and largest bipartite subgraphs. In W. Cook, L. Lovász, and P. Seymour, editors, Papers from the special year on Combinatorial Optimization, volume 00 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 000-000. American Mathematical Society, Providence, 0000.  L.I.P. Resende and M.G.C. Resende. A GRASP for frame relay permanent virtual circuit routing. In C.C. Ribeiro and P. Hansen, editors, Extended Abstracts of the III Metaheuristics International Conference, pages 000-000, Angra dos Reis, 0000.  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. A GRASP with path-relinking for private virtual circuit routing. Networks, 00:000-000, 0000a.  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  M. Sarrafzadeh and D. Lee. A new approach to topological via minimization. IEEE Transactions on Computer-Aided Design