Bibliography of Mauricio G.C.…

                      Bibliography of
                   Mauricio G.C. Resende
                  (Updated: May 14, 2007)




References
 [1] M.G.C. Resende. Implementation and testing of a primal-dual algorithm
     for the assignment problem. In XIII Brazilian Operations Research Sym-
     posium, pages 284­299, October 1980. In Portuguese.

 [2] R.E. Campello, L.H. Coutinho, and M.G.C. Resende. A generation dis-
     patching system for the analysis of transmission and energy interchange
     in Brazil. Chilean J. of Systems Engineering, 4:45­68, 1984. In Spanish.

 [3] M.G.C. Resende. Computer simulation of semiconductor wafer fabrica-
     tion. Technical Report ORC 86-14, Operations Research Center, Univer-
     sity of California, Berkeley, CA, December 1985.

 [4] M.G.C. Resende. A computer program for reliability evaluation of large-
     scale networks via polygon-to-chain reductions. IEEE Transactions on
     Reliability, R-35:24­29, 1986.

 [5] C.R. Glassey and M.G.C. Resende. Seeking an optimally balanced dis-
     patching rule for semiconductor wafer fabrication. J. Electrochemical So-
     ciety, 133:C327­C327, 1986.

 [6] M.G.C. Resende. Shop floor scheduling of semiconductor wafer manufac-
     turing. PhD thesis, University of California, Berkeley, CA, August 1987.
 [7] C.R. Glassey and M.G.C. Resende. Closed-loop job release control for
     VLSI circuit manufacturing. IEEE Transactions on Semiconductor Man-
     ufacturing, 1:36­46, 1988.

 [8] C.R. Glassey and M.G.C. Resende. A scheduling rule for job release in
     semiconductor fabrication. Operations Research Letters, 7:213­217, 1988.




                                     1
 [9] R.A. Zuanich, D.F. Ruffcorn, and M.G.C. Resende.            Beyond the
     spreadsheet­ Wafer production planning with start demand rate calcu-
     lation through simulation models. J. Electrochemical Society, 135:C371­
     C371, 1988.

[10] T.A. Feo and M.G.C. Resende. A probabilistic heuristic for a computation-
     ally difficult set covering problem. Operations Research Letters, 8:67­71,
     1989.

[11] I. Adler, N.K. Karmarkar, M.G.C. Resende, and G. Veiga. Data struc-
     tures and programming techniques for the implementation of Karmarkar's
     algorithm. ORSA J. on Computing, 1:84­106, 1989.

[12] I. Adler, M.G.C. Resende, G. Veiga, and N. Karmarkar. An implemen-
     tation of Karmarkar's algorithm for linear programming. Mathematical
     Programming, 44:297­335, 1989.

[13] N. Karmarkar, M.G.C. Resende, and K.G. Ramakrishnan. An interior
     point approach to the maximum independent set problem in dense random
     graphs. In XIII Latin American Conference on Informatics, volume 1,
     pages 241­260, Santiago, Chile, July 1989.

[14] A.P. Kamath, N. Karmarkar, K.G. Ramakrishnan, and M.G.C. Resende.
     Computational experience with an interior point algorithm on the Satisfi-
     ability Problem. In MPS Conference on Integer Programming and Com-
     binatorial Optimization, pages 333­349, Waterloo University, Waterloo,
     Canada, May 1990.

[15] A.P. Kamath, N. Karmarkar, K.G. Ramakrishnan, and M.G.C. Resende.
     Computational experience with an interior point algorithm on the Satis-
     fiability Problem. Annals of Operations Research, 25:43­58, 1990.

[16] R.D.C. Monteiro, I. Adler, and M.G.C. Resende. A polynomial-time
     primal-dual affine scaling algorithm for linear and convex quadratic pro-
     gramming and its power series extension. Mathematics of Operations Re-
     search, 15:191­214, 1990.

[17] N. Karmarkar, M.G.C. Resende, and K.G. Ramakrishnan. An interior
     point algorithm to solve computationally difficult set covering problems.
     Mathematical Programming, 52:597­618, 1991.

[18] A.P. Kamath, N. Karmarkar, K.G. Ramakrishnan, and M.G.C. Resende.
     A continuous approach to inductive inference. Mathematical Program-
     ming, 57:215­238, 1992.

[19] P.M. Pardalos and M.G.C. Resende. Computational aspects of combina-
     torial optimization. COAL Bulletin, Mathematical Programming Society,
     21, 1992.



                                      2
[20] A.P. Kamath, N. Karmarkar, K.G. Ramakrishnan, and M.G.C. Resende.
     An interior point approach to Boolean vector function synthesis. In 36th
     MSCAS, pages 185­189, 1993.

[21] M.G.C. Resende and G.Veiga. An implementation of the dual affine scaling
     algorithm for minimum cost flow on bipartite uncapacitated networks.
     SIAM J. on Optimization, 3:516­537, 1993.

[22] M.G.C. Resende, T. Tsuchiya, and G. Veiga. Identifying the optimal
     face of a network linear program with a globally convergent interior point
     method. In Proceedings of NETFLOW93, pages 196­206, October 1993.
     Technical Report TR-21/93, Dipartimento di Informatica, Universit` di a
     Pisa.

[23] M.G.C. Resende and G. Veiga. Computing the projection in an interior
     point algorithm: An experimental comparison. Investigaci´n Operativa,
                                                             o
     3:81­92, 1993.

[24] M.G.C. Resende and G. Veiga. An efficient implementation of a net-
     work interior point method. In D.S. Johnson and C.C. McGeoch, editors,
     Network Flows and Matching: First DIMACS Implementation Challenge,
     volume 12 of DIMACS Series on Discrete Mathematics and Theoretical
     Computer Science, pages 299­348. American Mathematical Society, 1993.

[25] T.A. Feo, M.G.C. Resende, and S.H. Smith. A greedy randomized adap-
     tive search procedure for maximum independent set. Operations Research,
     42:860­878, 1994.

[26] Y. Li, P.M. Pardalos, K.G. Ramakrishnan, and M.G.C. Resende. Lower
     bounds for the quadratic assignment problem. Annals of Operations Re-
     search, 50:387­411, 1994.

[27] P.M. Pardalos, M.G.C. Resende, and K.G. Ramakrishnan. DIMACS work-
     shop on parallel processing of discrete optimization problems. Technical
     Report 94-20, Center for Discrete Mathematics and Theoretical Computer
     Science, Piscataway, NJ, April 1994.

[28] M.G.C. Resende, T. Tsuchiya, and G. Veiga. Identifying the optimal
     face of a network linear program with a globally convergent interior point
     method. In W.W. Hager, D.W. Hearn, and P.M. Pardalos, editors, Large
     Scale Optimization: State of the Art, pages 362­387. Kluwer Academic
     Publishers, 1994.

[29] M.G.C. Resende, K.G. Ramakrishnan, and Z. Drezner. Computing lower
     bounds for the quadratic assignment problem with an interior point algo-
     rithm for linear programming. Operations Research, 43(5):781­791, 1995.

[30] P.M. Pardalos, L. Pitsoulis, T. Mavridou, and M.G.C. Resende. Paral-
     lel search for combinatorial optimization: Genetic algorithms, simulated


                                      3
    annealing, tabu search, and GRASP. In A. Ferreira and J. Rolim, edi-
    tors, Parallel Algorithms for Irregularly Structured Problems, Proceedings
    of the Second International Workshop ­Irregular'95, volume 980 of Lecture
    Notes in Computer Science, pages 317­331. Springer-Verlag, 1995.
[31] R.S. Barr, B.L. Golden, J.P. Kelly, M.G.C. Resende, and W.R. Stew-
     art. Designing and reporting on computational experiments with heuristic
     methods. J. of Heuristics, 1(1):9­32, 1995.
[32] T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search pro-
     cedures. J. of Global Optimization, 6:109­133, 1995.
[33] P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. A parallel GRASP
     implementation for the quadratic assignment problem. In A. Ferreira
     and J. Rolim, editors, Parallel Algorithms for Irregularly Structured Prob-
     lems ­ Irregular'94, pages 115­133. Kluwer Academic Publishers, 1995.
[34] P.M. Pardalos, M.G.C. Resende, and K.G. Ramakrishnan. Parallel Pro-
     cessing of Discrete Optimization Problems, volume 22 of DIMACS Series
     on Discrete Mathematics and Theoretical Computer Science. American
     Mathematical Society, 1995.
[35] K.G. Ramakrishnan, M.G.C. Resende, and P.M. Pardalos. A branch
     and bound algorithm for the quadratic assignment problem using a lower
     bound based on linear programming. In C. Floudas and P.M. Pardalos,
     editors, State of the Art in Global Optimization: Computational Methods
     and Applications, pages 57­73. Kluwer Academic Publishers, 1995.
[36] M.G.C. Resende, P.M. Pardalos, and Y. Li. Algorithm 754: Fortran sub-
     routines for approximate solution of dense quadratic assignment problems
     using GRASP. ACM Transactions on Mathematical Software, 22:104­118,
     March 1996.
[37] M.G.C. Resende and T.A. Feo. A GRASP for satisfiability. In D.S. John-
     son and M.A. Trick, editors, The Second DIMACS Implementation Chal-
     lenge, volume 26 of DIMACS Series on Discrete Mathematics and Theo-
     retical Computer Science, pages 499­520. American Mathematical Society,
     1996.
[38] M.G.C. Resende and P.M. Pardalos. Interior point algorithms for network
     flow problems. In J.E. Beasley, editor, Advances in linear and integer
     programming, pages 147­187. Oxford University Press, 1996.
[39] P.M. Pardalos and M.G.C. Resende. Interior point methods for global op-
     timization. In T. Terlaky, editor, Interior point methods in mathematical
     programming, pages 467­500. Kluwer Academic Publishers, 1996.
[40] P. M. Pardalos, L. S. Pitsoulis, and M. G. C. Resende. A parallel GRASP
     for MAX-SAT problems. Lecture Notes in Computer Science, 1180:575­
     585, 1996.


                                      4
[41] M.G.C. Resende and C.C. Ribeiro. A GRASP for graph planarization.
     Networks, 29:173­189, 1997.

[42] P.M. Pardalos, K.G. Ramakrishnan, M.G.C. Resende, and Y. Li. Im-
     plementation of a variance reduction based lower bound in a branch and
     bound algorithm for the quadratic assignment problem. SIAM J. on Op-
     timization, 7:280­294, 1997.

[43] P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. Algorithm 769: FOR-
     TRAN subroutines for approximate solution of sparse quadratic assign-
     ment problems using GRASP. ACM Trans. Math. Software, 23(2):196­
     208, 1997.

[44] L. Fossett, D. N. Lee, L. I. P. Resende, and M. G. C. Resende. A mul-
     ticomodity flow approach to global facility planning. Technical report,
     Information Sciences Research Center, AT&T Labs Research, Florham
     Park, NJ, 1997.

[45] M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos. Approximate solution
     of weighted MAX-SAT problems using GRASP. In J. Gu and P.M. Parda-
     los, editors, Satisfiability Problem: Theory and Applications, DIMACS
     Series on Discrete Mathematics and Theoretical Computer Science, pages
     393­405. American Mathematical Society, 1997.

[46] M. G. C. Resende. PoP placement to maximize coverage. Technical report,
     Information Sciences Research Center, AT&T Labs Research, Florham
     Park, NJ, 1997.

[47] M. G. C. Resende and O. Ulular. SMART: A tool for AT&T WorldNet
     access design ­ Cascade 9000 Concentrators. Technical report, Information
     Sciences Research Center, AT&T Labs Research, Florham Park, NJ, 1997.

[48] L. I. P. Resende and M. G. C. Resende. A GRASP for frame relay PVC
     routing. Technical report, Information Sciences Research Center, AT&T
     Labs Research, Florham Park, NJ, 1997.

[49] J.J. J´dice, L.F. Portugal, M.G.C. Resende, and G. Veiga. A truncated in-
           u
     terior point method for the solution of minimum cost flow problems on an
     undirected multicommodity network. In Proceedings of First Portuguese
     National Telecommunications Conference, pages 381­384, April 1997.

[50] M. G. C. Resende. Computing approximate solutions of the maximum
     covering problem using GRASP. J. of Heuristics, 4:161­171, 1998.

[51] J. E. Mitchell, P. M. Pardalos, and M. G. C. Resende. Interior point algo-
     rithms for combinatorial optimization. In D.-Z. Du and P. M. Pardalos,
     editors, Handbook of combinatorial optimization, volume 1, pages 189­298.
     Kluwer Academic Publishers, 1998.



                                      5
[52] J. Abello, P.M. Pardalos, and M.G.C. Resende. On very large maximum
     clique problems. In R. Battiti and A. Bertossi, editors, Proceedings of
     Algorithms and Experiments (ALEX98), pages 175­183, 1998.

[53] P.M. Pardalos, J. Rappe, and M.G.C. Resende. An exact parallel algo-
     rithm for the maximum clique problem. In R. de Leone, A. Murli, P.M.
     Pardalos, and G. Toraldo, editors, High performance algorithms and soft-
     ware in nonlinear optimization, pages 279­300. Kluwer Academic Pub-
     lishers, 1998.

[54] T. Mavridou, P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. A
     GRASP for the biquadratic assignment problem. European J. of Op-
     erational Research, pages 613­621, 1998.

[55] M. G. C. Resende, T. A. Feo, and S. H. Smith. Algorithm 786: FOR-
     TRAN subroutines for approximate solution of maximum independent set
     problems using GRASP. ACM Transactions on Mathematical Software,
     24(4):386­394, 1998.

[56] P.M. Pardalos, T. Qian, and M.G.C. Resende. A greedy randomized adap-
     tive search procedure for the feedback vertex set problem. J. of Combi-
     natorial Optimization, 2(4):399­412, 1999.

[57] C. C. Ribeiro and M. G. C. Resende. Algorithm 797: FORTRAN sub-
     routines for approximate solution of graph planarization problems using
     GRASP. ACM Transactions on Mathematical Software, 25:341­352, 1999.

[58] S.L. Martins, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro. Greedy
     randomized adaptive search procedures for the Steiner problem in graphs.
     In P.M. Pardalos and S. Rajasekaran, editors, Randomization methods in
     algorithm design, volume 43 of DIMACS Series on Discrete Mathematics
     and Theoretical Computer Science, pages 133­145. American Mathemat-
     ical Society, 1999.

[59] R.A. Murphey, P.M. Pardalos, and M.G.C. Resende. Frequency assign-
     ment problems. In D.-Z. Du and P. M. Pardalos, editors, Handbook of
     combinatorial optimization, volume Supplement A, pages 295­377. Kluwer
     Academic Publishers, 1999.

[60] J. Abello, P.M. Pardalos, and M.G.C. Resende. On maximum clique
     problems in very large graphs. In J. Abello and J. Vitter, editors, External
     memory algorithms and visualization, volume 50 of DIMACS Series on
     Discrete Mathematics and Theoretical Computer Science, pages 119­130.
     American Mathematical Society, 1999.

[61] P. Festa, P.M. Pardalos, and M.G.C. Resende. Feedback set problems.
     In D.-Z. Du and P. M. Pardalos, editors, Handbook of combinatorial opti-
     mization, pages 209­259. Kluwer Academic Publishers, 1999.



                                       6
[62] S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro. Local search with per-
     turbations for the prize-collecting Steiner tree problem. In P. Hansen and
     C.C. Ribeiro, editors, Proceedings of the III Metaheuristics International
     Conference (MIC99), pages 115­119, 1999.

[63] S.L. Martins, M.G.C. Resende, and C.C. Ribeiro. A parallel GRASP for
     the Steiner problem in graphs using a hybrid local search. In P. Hansen and
     C.C. Ribeiro, editors, Proceedings of the III Metaheuristics International
     Conference (MIC99), pages 317­322, 1999.

[64] L.I.P. Resende and M.G.C. Resende. A GRASP for frame relay permanent
     virtual circuit routing. In P. Hansen and C.C. Ribeiro, editors, Proceedings
     of the III Metaheuristics International Conference (MIC99), pages 397­
     401, 1999.

[65] M.C. Medeiros, M.G.C. Resende, and A. Veiga. Piecewise linear time
     series estimation with GRASP. In P. Hansen and C.C. Ribeiro, editors,
     Proceedings of the III Metaheuristics International Conference (MIC99),
     pages 329­333, 1999.

[66] S. Binato, W.J. Hery, D.M. Loewenstern, and M.G.C. Resende. A GRASP
     for job shop scheduling. In P. Hansen and C.C. Ribeiro, editors, Proceed-
     ings of the III Metaheuristics International Conference (MIC99), pages
     57­61, 1999.

[67] M.G.C. Resende. GRASP: A bibliography. In P. Hansen and C.C. Ribeiro,
     editors, Proceedings of the III Metaheuristics International Conference
     (MIC99), pages 403­410, 1999.

[68] X. Liu, P.M. Pardalos, S. Rajasekaran, and M.G.C. Resende. A GRASP
     for frequency assignment in mobile radio networks. In B.R. Badrinath,
     F. Hsu, P.M. Pardalos, and S. Rajasejaran, editors, Mobile Networks and
     Computing, volume 52 of DIMACS Series on Discrete Mathematics and
     Theoretical Computer Science, pages 195­201. American Mathematical
     Society, 2000.

[69] L.F. Portugal, M.G.C. Resende, G. Veiga, and J.J. J´dice. A truncated
                                                            u
     primal-infeasible dual-feasible interior point network flow method. Net-
     works, 35:91­108, 2000.

[70] M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos. FORTRAN subrou-
     tines for computing approximate solutions of weighted MAX-SAT prob-
     lems using GRASP. Discrete Applied Mathematics, 100:95­113, 2000.

[71] S.L. Martins, M.G.C. Resende, C.C. Ribeiro, and P.M. Pardalos. A par-
     allel GRASP for the Steiner tree problem in graphs using a hybrid local
     search strategy. J. of Global Optimization, 17:267­283, 2000.




                                       7
[72] R.M. Aiex, P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. A GRASP
     for computing approximate solutions for the three-index assignment prob-
     lem. In Proceedings of Parallel and Distributed Processing, volume 1080
     of Lecture Notes in Computer Science, page 504, 2000.

[73] P. Festa, P.M. Pardalos, and M.G.C. Resende. Algorithm 815: FOR-
     TRAN subroutines for approximate solution of feedback set problems us-
     ing GRASP. ACM Transactions on Mathematical Software, 27:456­464,
     2001.

[74] P. Festa, P.M. Pardalos, and M.G.C. Resende. Feedback set problems. In
     Encyclopedia of Optimization, volume 2, pages 94­106. Kluwer Academic
     Publishers, 2001.

[75] M.G.C. Resende and C.C. Ribeiro. Graph planarization. In Encyclopedia
     of Optimization, volume 2, pages 368­373. Kluwer Academic Publishers,
     2001.

[76] M.G.C. Resende.    Greedy randomized adaptive search procedures
     (GRASP). In Encyclopedia of Optimization, volume 2, pages 373­382.
     Kluwer Academic Publishers, 2001.

[77] J. Abello, S. Butenko, P.M. Pardalos, and M.G.C. Resende. Finding
     independent sets in a graph using continuous multivariable polynomial
     formulations. J. of Global Optimization, 21:111­137, 2001.

[78] S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro. Local search with per-
     turbations for the prize-collecting Steiner tree problem in graphs. Net-
     works, 38:50­58, 2001.

[79] M.C. Medeiros, M.G.C. Resende, and A. Veiga. Piecewise linear time
     series estimation with GRASP. Computational Optimization and Appli-
     cations, 19:127­144, 2001.

[80] F.C. Gomes, C.S. Oliveira, P.M. Pardalos, and M.G.C. Resende. Reactive
     GRASP with path relinking for channel assignment in mobile phone net-
     works. In Proceedings of the 5th International Workshop on Discrete Al-
     gorithms and Methods for Mobile Computing and Communications, pages
     60­67. ACM Press, 2001.

[81] P. Festa, P.M. Pardalos, M.G.C. Resende, and Ribeiro. GRASP and VNS
     for Max-Cut. In J.P. Sousa, editor, Proceedings of the IV Metaheuristics
     International Conference (MIC2001), pages 371­376, 2001.

[82] S. Binato, H. Faria Jr., and M.G.C. Resende. Greedy randomized adaptive
     path relinking. In J.P. Sousa, editor, Proceedings of the IV Metaheuristics
     International Conference (MIC2001), pages 393­397, 2001.




                                      8
[83] P. Festa and M.G.C. Resende. GRASP: An annotated bibliography. In
     C.C. Ribeiro and P. Hansen, editors, Essays and Surveys on Metaheuris-
     tics, pages 325­367. Kluwer Academic Publishers, 2002.
[84] S. Binato, W.J. Hery, D.M. Loewenstern, and M.G.C. Resende. A GRASP
     for job shop scheduling. In C.C. Ribeiro and P. Hansen, editors, Essays
     and Surveys on Metaheuristics, pages 58­79. Kluwer Academic Publishers,
     2002.
[85] J. Abello, P.M. Pardalos, and M.G.C. Resende, editors. Handbook of
     Massive Data Sets. Kluwer Academic Publishers, 2002.
[86] P.M. Pardalos and M.G.C. Resende, editors. Handbook of Applied Opti-
     mization. Oxford University Press, 2002.
[87] M.G.C. Resende and C.C. Ribeiro. Greedy randomized adaptive search
     procedures. In F. Glover and G. Kochenberger, editors, Handbook of Meta-
     heuristics, pages 219­249. Kluwer Academic Publishers, 2002.
[88] S. Duni, P.M. Pardalos, and M.G.C. Resende. Parallel metaheuristics
     for combinatorial optimization. In R. Corr^a, I. Dutra, M. Fiallos, and
                                               e
     F. Gomes, editors, Models for Parallel and Distributed Computation ­
     Theory, Algorithmic Techniques and Applications, pages 179­206. Kluwer
     Academic Publishers, 2002.
[89] R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro. Probability distribution of
     solution time in GRASP: An experimental investigation. J. of Heuristics,
     8:343­373, 2002.
[90] M.C. Medeiros, A. Veiga, and M.G.C. Resende. A combinatorial approach
     to piecewise linear time series analysis. J. of Computational and Graphical
     Statistics, 11:236­258, 2002.
[91] J. Abello, M.G.C. Resende, and S. Sudarsky. Massive quasi-clique detec-
     tion. In S. Rajsbaum, editor, LATIN 2002: Theoretical Informatics, vol-
     ume 2286 of Lecture Notes in Computer Science, pages 598­612. Springer-
     Verlag, 2002.
[92] K.G. Ramakrishnan, B. Ramachandran, M.G.C. Resende, and J.F. Pekny.
     Tight qap bounds via linear programming. In P.M. Pardalos, A. Migdalas,
     and R.E. Burkard, editors, Combinatorial and Global Optimization, pages
     297­303. World Scientific Publishing Co., 2002.
[93] M. Ericsson, M.G.C. Resende, and P.M. Pardalos. A genetic algorithm
     for the weight setting problem in OSPF routing. J. of Combinatorial
     Optimization, 6:299­333, 2002.
[94] L.S. Pitsoulis and M.G.C. Resende. Greedy randomized adaptive search
     procedures. In P.M. Pardalos and M.G.C. Resende, editors, Handbook of
     Applied Optimization, pages 168­183. Oxford University Press, 2002.


                                      9
 [95] P.M. Pardalos and M.G.C. Resende. Introduction to the Handbook of Ap-
      plied Optimization. In P.M. Pardalos and M.G.C. Resende, editors, Hand-
      book of Applied Optimization, pages xv­xviii. Oxford University Press,
      2002.

 [96] P.M. Pardalos and M.G.C. Resende. Introduction to Combinatorial Op-
      timization. In P.M. Pardalos and M.G.C. Resende, editors, Handbook of
      Applied Optimization, pages 51­53. Oxford University Press, 2002.

 [97] L. Buriol, M.G.C. Resende, C.C. Ribeiro, and M. Thorup. A memetic
      algorithm for OSPF routing. In Proceedings of the 6th INFORMS Telecom,
      pages 187­188, 2002.

 [98] P. Festa, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro. Random-
      ized heuristics for the MAX-CUT problem. Optimization Methods and
      Software, 7:1033­1058, 2002.

 [99] A.S. da Cunha, A. Lucena, N. Maculan, and M.G.C. Resende. A relax
      and cut algorithm for the prize collecting Steiner problem in graphs. In
      Proceedings of Mathematical Programming in Rio, pages 72­78, 2003.

[100] L.S. Buriol, P.M. Fran¸a, M.G.C. Resende, and Thorup M. Network
                             c
      design for OSPF routing. In Proceedings of Mathematical Programming
      in Rio, pages 40­44, 2003.

[101] J.J. J´dice, J.M. Patr´
            u               icio, L.F. Portugal, M.G.C. Resende, and G. Veiga.
      A study of preconditioners for network interior point methods. Computa-
      tional Optimization and Applications, 24:5­35, 2003.

[102] R.M. Aiex, S. Binato, and M.G.C. Resende. Parallel GRASP with path-
      relinking for job shop scheduling. Parallel Computing, 29:393­430, 2003.

[103] M.G.C. Resende and R.F. Werneck. On the implementation of a swap-
      based local search procedure for the p-median problem. In Richard E.
      Ladner, editor, Proceedings of the Fifth Workshop on Algorithm Engi-
      neering and Experiments ­ ALENEX03, pages 119­127, 2003.

[104] M.G.C. Resende and C.C. Ribeiro. A GRASP with path-relinking for
      private virtual circuit routing. Networks, 41(1):104­114, 2003.

[105] M.G.C. Resende. Combinatorial optimization in telecommunications. In
      P.M. Pardalos and V. Korotkich, editors, Optimization and Industy: New
      Frontiers, pages 59­112. Kluwer Academic Publishers, 2003.

[106] M.G.C. Resende and G. Veiga. An annotated bibliography of network
      interior point methods. Networks, 42:114­121, 2003.

[107] M. G. C. Resende and J. P. de Sousa, editors. Metaheuristics: Computer
      decision-making. Kluwer Academic Publishers, 2003.



                                     10
[108] M.G.C. Resende and C.C. Ribeiro. GRASP and path-relinking: Recent
      advances and applications. In Toshihide Ibaraki and Yasunari Yoshitomi,
      editors, Proceedings of the Fifth Metaheuristics International Conference
      (MIC2003), pages T6­1 ­ T6­6, 2003.

[109] P. Festa and M.G.C. Resende. CIRCUT+PR: A rank-2 heuristic with
      path-relinking. In Toshihide Ibaraki and Yasunari Yoshitomi, editors, Pro-
      ceedings of the Fifth Metaheuristics International Conference (MIC2003),
      pages 19­1 ­ 19­7, 2003.

[110] C.A. Oliveira, P.M. Pardalos, and M.G.C. Resende. GRASP with path-
      relinking for the QAP. In Toshihide Ibaraki and Yasunari Yoshitomi,
      editors, Proceedings of the Fifth Metaheuristics International Conference
      (MIC2003), pages 57­1 ­ 57­6, 2003.

[111] M.G.C. Resende and J.L. Gonzalez-Velarde. GRASP: Procedimientos de
      b´squeda miope aleatorizado y adaptativo. Inteligencia Artificial, (19):61­
       u
      76, 2003.

[112] C.A. Oliveira, P.M. Pardalos, and M.G.C. Resende. GRASP with path-
      relinking for the quadratic assignment problem. In C.C. Ribeiro and S.L.
      Martins, editors, Proceedings of III Workshop on Efficient and Experi-
      mental Algorithms (WEA2004), volume 3059, pages 356­368. Springer,
      2004.

[113] P. Festa and M.G.C. Resende. An annotated bibliography of GRASP.
      Technical Report TD-5WYSEW, AT&T Labs Research, Florham Park,
      NJ 07932, 2004.

[114] J.F. Gon¸alves and M.G.C. Resende. An evolutionary algorithm for man-
               c
      ufacturing cell formation. Computers and Industrial Engineering, 47:247­
      273, 2004.

[115] M.G.C. Resende and R.F. Werneck. A hybrid heuristic for the p-median
      problem. J. of Heuristics, 10:59­88, 2004.

[116] A. Lucena and M.G.C. Resende. Strong lower bounds for the prize col-
      lecting Steiner tree problem in graphs. Discrete Applied Mathematics,
      141:277­294, 2004.

[117] J. Patr´icio, L.F. Portugal, M.G.C. Resende, G. Veiga, and J.J. J´dice.
                                                                         u
      Fortran subroutines for network flow optimization using an interior point
      algorithm. Technical Report TD-5X2SLN, AT&T Labs Research, Florham
      Park, NJ 07932, 2004.

[118] H. Faria Jr., S. Binato, M.G.C. Resende, and D.J. Falc~o. Transmission
                                                            a
      network design by a greedy randomized adaptive path relinking approach.
      IEEE Transactions on Power Systems, 20:43­49, 2005.



                                       11
[119] E.M. Macambira, C.N. Meneses, P.M. Pardalos, and M.G.C. Resende. A
      novel integer programming formulation for the K-SONET ring assignment
      problem. Technical Report TD-6HLLNR, AT&T Labs Research, Florham
      Park, NJ 07932, 2005.
[120] R.M. Aiex, P.M. Pardalos, M.G.C. Resende, and G. Toraldo. GRASP with
      path-relinking for three-index assignment. INFORMS J. on Computing,
      17:224­247, 2005.
[121] L.S. Buriol, M.G.C. Resende, C.C. Ribeiro, and M. Thorup. A hybrid
      genetic algorithm for the weight setting problem in OSPF/IS-IS routing.
      Networks, 46:36­56, 2005.
[122] J.F. Gon¸alves, J.J.M. Mendes, and M.G.C. Resende. A hybrid genetic
               c
      algorithm for the job shop scheduling problem. European J. of Operational
      Research, 167:77­95, 2005.
[123] R. Teixeira, T.G. Griffin, M.G.C. Resende, and J. Rexford. TIE Breaking:
      Tunable Interdomain Egress Selection. In Proceedings of CoNEXT, ACM
      Conference on Emerging Network Experiment and Technology (CoNEXT
      2005), pages 93­104. ACM Press, 2005.
[124] C. Commander, C.A.S. Oliveira, P.M. Pardalos, and M.G.C. Resende. A
      GRASP heuristic for the cooperative communication problem in ad hoc
      networks. In Proceedings of VI International Metaheuristics Conference
      (MIC 2005), pages 225­230, 2005.
[125] M.G.C. Resende and R.F. Werneck. A hybrid multistart heuristic for
      the uncapacitated facility location problem. European J. of Operational
      Research, 174:54­68, 2006.
[126] R.M. Aiex and M.G.C. Resende. Parallel strategies for GRASP with
      path-relinking. In T. Ibaraki, K. Nonobe, and M. Yagiura, editors, Meta-
      heuristics: Progress as Real Problem Solvers, pages 301­331. Springer,
      2005.
[127] M.G.C. Resende and C.C. Ribeiro. GRASP with path-relinking: Recent
      advances and applications. In T. Ibaraki, K. Nonobe, and M. Yagiura,
      editors, Metaheuristics: Progress as Real Problem Solvers, pages 29­63.
      Springer, 2005.
[128] P. Festa, P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. GRASP with
      path-relinking for the weighted maximum satisfiability problem. In S.E.
      Nikoletseas, editor, Proceedings of IV Workshop on Efficient and Exper-
      imental Algorithms (WEA2005), volume 3503, pages 367­379. Springer,
      2005.
[129] M.G.C. Resende and C.C. Ribeiro. Parallel Greedy Randomized Adaptive
      Search Procedures. In E. Alba, editor, Parallel Metaheuristics: A new
      class of algorithms, pages 315­346. John Wiley and Sons, 2005.


                                      12
[130] M.J. Hirsch, P.M. Pardalos, and M.G.C. Resende. Speeding up continuous
      GRASP. Technical Report TD-6U2P2H, AT&T Labs Research, Florham
      Park, NJ 07932, 2006.
[131] J.F. Gon¸alves and M.G.C. Resende.
                c                                A hybrid heuristic for the
      constrained two-dimensional non-guillotine orthogonal cutting problem.
      Technical Report TD-6UNQN6, AT&T Labs Research, Florham Park,
      NJ 07932, 2006.
[132] M.J. Hirsch, C.N. Meneses, P.M. Pardalos, M.A. Ragle, and M.G.C. Re-
      sende. A continuous GRASP to determine the relationship between drugs
      and adverse reactions. Technical Report TD-6UPR92, AT&T Labs Re-
      search, Florham Park, NJ 07932, 2006.
[133] M.J. Hirsch, P.M. Pardalos, and M.G.C. Resende. Solving systems of non-
      linear equations with continuous GRASP. Technical Report TD-6V6JCX,
      AT&T Labs Research, Florham Park, NJ 07932, 2006.
[134] M.G. Ravetti, F.G. Nakamura, C.N. Meneses, M.G.C. Resende, G.R. Ma-
      teus, and P.M. Pardalos. Hybrid heuristics for the permutation flow shop
      problem. Technical Report TD-6V9MEV, AT&T Labs Research, Florham
      Park, NJ 07932, 2006.
[135] M.J. Hirsch, P.M. Pardalos, and M.G.C. Resende. Recognition of pro-
      jected 3D points and lines using a continuous GRASP. Technical Report
      TD-6XLTAY, AT&T Labs Research, Florham Park, NJ 07932, 2006.
[136] P. Festa, P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende. GRASP
      with path-relinking for the weighted MAXSAT problem. ACM J. of Ex-
      perimental Algorithmics, 11, 2006. article 2.4: 1-16.
[137] M.G.C. Resende and P.M. Pardalos, editors. Handbook of Optimization
      in Telecommunication. Springer Science + Business Media, 2006.
[138] M.J. Hirsch, P.M. Pardalos, and M.G.C. Resende. Sensor registration in
      a sensor network by continuous GRASP. In Proceedings of IEEE Military
      Communications Conference (MILCOM 2006), 2006.
[139] R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro. TTTPLOTS: A perl pro-
      gram to create time-to-target plots. Optimization Letters, 2006. Published
      online [doi:10.1007/s11590-006-0031-4].
[140] C.A.S. Oliveira, P.M. Pardalos, and M.G.C. Resende. Optimization prob-
      lems in multicast tree construction. In M.G.C. Resende and P.M. Pardalos,
      editors, Handbook of Optimization in Telecommunications, pages 701­731.
      Springer Science + Business Media, 2006.
[141] D.V. Andrade, L.S. Buriol, M.G.C. Resende, and M. Thorup. Survivable
      composite-link IP network design with OSPF routing. In Proceedings of
      The Eighth INFORMS Telecommunications Conference, 2006.


                                      13
[142] D.V. Andrade and M.G.C. Resende. A GRASP for PBX telephone mi-
      gration scheduling. In Proceedings of The Eighth INFORMS Telecommu-
      nications Conference, 2006.
[143] C. Commander, P. Festa, C.A.S. Oliveira, P.M. Pardalos, M.G.C. Re-
      sende, and M. Tsitselis. A greedy randomized algorithm for the coopera-
      tive communication problem on ad hoc networks. In Proceedings of The
      Eighth INFORMS Telecommunications Conference, 2006.
[144] C.N. Meneses, P.M. Pardalos, M.G.C. Resende, and A. Vazacopoulos.
      Modeling and solving string selection problems. In R. Mondaini and
      R. Dil~o, editors, Proceedings of the 2005 International Symposium on
            a
      Mathematical and Computational Biology ­ BIOMAT 2005, pages 54­64.
      E-papers Servios Editoriais Ltda., 2006.
[145] M.G.C. Resende and R.F. Werneck. A fast swap-based local search proce-
      dure for location problems. Annals of Operations Research, 150:205­230,
      2007.
[146] C.A. Oliveira, P.M. Pardalos, O. Prokopyev, and M.G.C. Resende.
      Streaming cache placement problems: Complexity and algorithms. Inter-
      national J. of Computational Science and Engineering, 2007. To appear.
[147] L.S. Buriol, M.G.C. Resende, and M. Thorup. Speeding up dynamic
      shortest path algorithms. INFORMS J. on Computing, 2007. To appear.
[148] A.S. da Cunha, A. Lucena, N. Maculan, and M.G.C. Resende. Primal and
      dual bounds for the prize-collecting Steiner problem in graphs. Technical
      Report TD-6XL7KT, AT&T Labs Research, Florham Park, NJ 07932,
      2007.
[149] C. Commander, P. Festa, C.A.S. Oliveira, P.M. Pardalos, M.G.C. Re-
      sende, and M. Tsitselis. GRASP with path-relinking for the coopera-
      tive communication problem on ad hoc networks. Technical Report TD-
      6X3U73, AT&T Labs Research, Florham Park, NJ 07932, 2007.
[150] T.F. Noronha, M.G.C. Resende, and C.C. Ribeiro. A random-keys genetic
      algorithm for routing and wavelength assignment. Technical Report TD-
      6XPQVT, AT&T Labs Research, Florham Park, NJ 07932, 2007. To
      appear in Proceedings of Seventh Metaheuristics International Conference
      (MIC 2007).
[151] D.V. Andrade and M.G.C. Resende. GRASP with evolutionary path-
      relinking. Technical Report TD-6XPTS7, AT&T Labs Research, Florham
      Park, NJ 07932, 2007. To appear in Proceedings of Seventh Metaheuristics
      International Conference (MIC 2007).
[152] J.F. Gon¸alves, J.J.M. Mendes, and M.G.C. Resende. A random key
              c
      based genetic algorithm for the resource constrained project scheduling
      problems. Computers and Operations Research, 2007. To appear.


                                      14
[153] J.F. Gon¸alves, J.J.M. Mendes, and M.G.C. Resende. A genetic algorithm
               c
      for the resource constrained multi-project scheduling problem. European
      J. of Operational Research, 2007. To appear.

[154] R. Teixeira, T.G. Griffin, M.G.C. Resende, and J. Rexford. TIE Break-
      ing: Tunable Interdomain Egress Selection. IEEE/ACM Transactions on
      Networking, 2007. To appear.

[155] D.V. Andrade and M.G.C. Resende. GRASP with path-relinking for net-
      work migration scheduling. In Proceedings of International Network Op-
      timization Conference (INOC 2007), 2007.

[156] M.J. Hirsch, C.N. Meneses, P.M. Pardalos, and M.G.C. Resende. Global
      optimization by continuous GRASP. Optimization Letters, 1:201­212,
      2007.

[157] L.S. Buriol, M.G.C. Resende, and M. Thorup. Survivable IP network
      design with OSPF routing. Networks, 49:51­64, 2007.




                                     15