Rede de Colaboração
Diretório de grupos de pesquisa

Mauricio Guilherme de Carvalho Resende

Mauricio G.C. Resende completou o segundo grau na Escola Americana do Rio de Janeiro em 1973. Se formou como engenheiro eletricista (opção sistemas) pela Pontifícia Universidade Católica do Rio de Janeiro em 1978. De setembro de 1978 a agosto de 1979 fez o mestrado em pesquisa operacional na Georgia Institute of Technology em Atlanta, GA, EUA. Trabalhou na Acessoria de Métodos e Modelos de Furnas Centrais Elétricas de 1979 a 1982. De 1982 a 1987 cursou e completou o doutorado em pesquisa operacional (com áreas secundárias (minors) em ciências da computação e sistemas de informação) na University of California, Berkeley. É Doctor Honoris Causa pela Universidad Nacional de San Agustín de Arequipa (Peru, 2010). Desde 1988 trabalha como pesquisador na AT&T Bell Labs e AT&T Labs Research, respectivamente, nos departamentos de fundamentos matemáticos da computação e de pesquisa em algoritmos e otimização. É um dos pioneiros da área de metaheurísticas, tendo proposto a metaheurística GRASP em 1989. Também em 1989 publicou um artigo onde se demonstrou pela primeira vez que os métodos de pontos interiores podem ser mais rápidos do que o método simplex para programação linear. Atualmente atua nas áreas de métodos heurísticos para otimização combinatória e otimização aplicada à problemas na área das telecomunicações. É autor ou coautor de mais de 100 artigos em periódicos internacionais e livros e editou cinco livros, incluindo o "Handbook of Applied Optimization" (Oxford, 2002) e o "Handbook of Optimization in Telecommunications" (Springer, 2006). Possui dez patentes nos EUA e outras sete submetidas. É membro do corpo editorial de onze periódicos, incluindo Networks, J. of Global Optimization, J. of Heuristics, Computational Optimization and Applications, e J. of Combinatorial Optimization.
(Texto informado pelo autor)

Última atualização do currículo em 19/01/2012
Endereço para acessar este CV:
http://lattes.cnpq.br/6235837317096398
Dados pessoais
NomeMauricio Guilherme de Carvalho Resende
Nome em citações bibliográficasRESENDE, M. G. C.;Resende, M.G.C.;Resende, Mauricio G.C.;Resende, Mauricio G. C.
SexoMasculino
Endereço profissionalAT&T Labs Research.
180 Park Avenue, Bldg. 103, Room C241
07932 - Florham Park, - Estados Unidos
Telefone: (973) 3608444
URL da Homepage: http://www.research.att.com/~mgcr

Formação acadêmica/Titulação
1982 - 1987Doutorado em Pesquisa Operacional .
University of California, Berkeley.
Título: Shop floor scheduling of semiconductor wafer manufacturing, Ano de Obtenção: 1987.
Orientador: Charles Roger Glassey.
Bolsista do(a): Conselho Nacional de Desenvolvimento Científico e Tecnológico ,CNPq ,Brasil .
Palavras-chave: planejamento da produção; manufatura de semicondutores; scheduling; simulação.
Grande área: Ciências Exatas e da Terra / Área: Matemática / Subárea: Matemática Aplicada / Especialidade: Matemática Discreta e Combinatória.
Grande área: Engenharias / Área: Engenharia de Produção.
Grande área: Engenharias / Área: Engenharia Elétrica.
Setores de atividade: Fabricação de Equipamentos de Informática e Máquinas Para Escritório; Fabricação de Máquinas, Aparelhos e Materiais Elétricos; Logística de Transporte, Armazenagem e Comunicações.
1978 - 1979Mestrado em Pesquisa Operacional .
Georgia Institute of Technology, GIT, Estados Unidos.
Título: Mestrado sem tese (exame de qualificação para doutorado), Ano de Obtenção: 1979.
Orientador: Gary Parker.
1974 - 1978Graduação em Engenharia Elétrica - Sistemas .
Pontifícia Universidade Católica do Rio de Janeiro, PUC-Rio, Brasil.
Título: Programação linear para o planejamento da distribuição de derivados de petróleo.
Orientador: Christopher Patterson.
1969 - 1973Ensino Médio (2º grau) .
Escola Americana do Rio de Janeiro.

Atuação profissional
AT&T Labs Research, ATTLR, Estados Unidos.
Vínculo institucional
1988 - Atual Vínculo: Pesquisador, Enquadramento Funcional: Lead Member of Technical Staff, Carga horária: 40
Centrais Elétricas - Sede, FURNAS, Brasil.
Vínculo institucional
1979 - 1982 Vínculo: Celetista formal, Enquadramento Funcional: Engenheiro II, Carga horária: 40, Regime: Dedicação exclusiva.

Membro de corpo editorial
2008 - Atual Periódico: Optimization and Engineering
2007 - Atual Periódico: International Transactions in Operational Research
2006 - Atual Periódico: Statistical Analysis of Networks
2006 - Atual Periódico: The Operations Research Journal of the Spanish Society of Statistics and OR
2006 - Atual Periódico: Networks (New York, N.Y. Print)
2003 - Atual Periódico: Investigação Operacional
1998 - Atual Periódico: Pesquisa Operacional (Impresso)
1998 - Atual Periódico: Computational Optimization and Applications
1995 - Atual Periódico: Journal of Combinatorial Optimization
1995 - Atual Periódico: Journal of Global Optimization
1994 - Atual Periódico: Journal of Heuristics
1993 - 1994 Periódico: IIE Transactions on Research

Áreas de atuação
1. Grande área: Ciências Exatas e da Terra / Área: Matemática / Subárea: Matemática Aplicada / Especialidade: Matemática Discreta e Combinatória.
2. Grande área: Ciências Exatas e da Terra / Área: Ciência da Computação / Subárea: Matemática da Computação / Especialidade: Modelos Analíticos e de Simulação.
3. Grande área: Ciências Exatas e da Terra / Área: Ciência da Computação / Subárea: Teoria da Computação / Especialidade: Análise de Algoritmos e Complexidade de Computação.
4. Grande área: Engenharias / Área: Engenharia de Produção / Subárea: Pesquisa Operacional / Especialidade: Programação Linear, Não-Linear, Mista e Dinâmica.
5. Grande área: Engenharias / Área: Engenharia de Produção / Subárea: Pesquisa Operacional / Especialidade: Metaheurísticas.

Idiomas
Inglês Compreende Bem, Fala Bem, Lê Bem, Escreve Bem.
Português Compreende Bem, Fala Bem, Lê Bem, Escreve Bem.
Espanhol Compreende Bem, Fala Razoavelmente, Lê Bem, Escreve Pouco.
Italiano Compreende Razoavelmente, Fala Razoavelmente, Lê Razoavelmente, Escreve Pouco.
Francês Compreende Pouco, Fala Pouco, Lê Razoavelmente, Escreve Pouco.

Prêmios e títulos
2010Doctor Honoris Causa, Universidad Nacional de San Agustín de Arequipa (Peru).
2009Prêmio Roberto D. Galvão pelo melhor artigo do XLI SBPO, Sociedade Brasileira de Pesquisa Operacional.
2002Outstanding Professional and Academic Titles , Handbook of Applied Optimization, Honorable Mention, Association of American Publishers.
1994Obermann Fellowship, Center for Advanced Studies, University of Iowa.


Produção em C,T & A
Produção bibliográfica
Citações
Web of Science
Total de trabalhos66Total de citações1986Fator H23
RESENDE MGC  Data: 31/05/2011
SCOPUS
Total de trabalhos83Total de citações1920  
Resende, Mauricio G C; Resende, M. G C  Data: 11/10/2010
Outras
Total de trabalhos301Total de citações9117  
RESENDE MGC  Data: 03/06/2011
Artigos completos publicados em periódicos
1. Hirsch, Michael J. ; Pardalos, Panos M. ; Resende, Mauricio G. C. . Correspondence of projected 3-D points and lines using a continuous GRASP. International Transactions in Operational Research, v. 18, p. 493-511, 2011.
2. FRINHANI, R. M. ; Silva, R.M.A. ; MATEUS, G. R. ; Festa, P. ; RESENDE, M. G. C. . GRASP with path-relinking for data clustering: a case study for biological data. Lecture Notes in Computer Science, v. 6630, p. 410-420, 2011.
3. D.M. Silva ; Silva, R.M.A. ; MATEUS, G. R. ; Gonçalves, José Fernando ; RESENDE, M. G. C. ; Festa, P. . An iterative refinement algorithm for the minimum branch vertices problem. Lecture Notes in Computer Science, v. 6630, p. 421-433, 2011.
4. Gonçalves, José Fernando ; Resende, Mauricio G.C. . A parallel multi-population biased random-key genetic algorithm for a container loading problem. Computers & Operations Research, v. 39, p. 179-190, 2011.
5. Resende, Mauricio G. C. ; Ribeiro, Celso C. . Restart strategies for GRASP with path-relinking heuristics. Optimization Letters, v. 5, p. 467-478, 2011.
6. Pessoa, Luciana S. ; Resende, Mauricio G. C. ; Ribeiro, Celso C. . Experiments with LAGRASP heuristic for set k-covering. Optimization Letters, v. 5, p. 407-419, 2011.
7. Noronha, Thiago F. ; RESENDE, M. G. C. ; Ribeiro, Celso C. . A biased random-key genetic algorithm for routing and wavelength assignment. Journal of Global Optimization, v. 50, p. 503-518, 2011.
8. Gonçalves, José Fernando ; Resende, Mauricio G. C. . A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. Journal of Combinatorial Optimization, v. 22, p. 180-201, 2011.
9. Mateus, Geraldo R. ; Resende, Mauricio G. C. ; Silva, Ricardo M. A. . GRASP with path-relinking for the generalized quadratic assignment problem. Journal of Heuristics, v. 17, p. 527-565, 2011.
10. Gonçalves, José Fernando ; Resende, Mauricio G. C. . Biased random-key genetic algorithms for combinatorial optimization. Journal of Heuristics, v. 17, p. 487-525, 2011.
11. Gonçalves, José Fernando ; Resende, Mauricio G. C. ; Mendes, Jorge J. M. . A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem. Journal of Heuristics, v. 17, p. 467-486, 2011.
12. Duarte, A. ; Martí, R. ; RESENDE, M. G. C. ; Ricardo M. A. Silva . GRASP with path relinking heuristics for the antibandwidth problem. Networks (New York, N.Y. Print), v. 58, p. 171-189, 2011.
13. Chaovalitwongse, W. Art ; Oliveira, Carlos A. S. ; Chiarini, Bruno ; Pardalos, Panos M. ; Resende, Mauricio G. C. . Revised GRASP with path-relinking for the linear ordering problem. Journal of Combinatorial Optimization, v. 22, p. 572-593, 2011.
14. Paola Festa ; José F. Gonçalves ; RESENDE, M. G. C. ; Ricardo M. A. Silva . Automatic tuning of GRASP with path-relinking heuristics with a biased random-key genetic algorithm. Lecture Notes in Computer Science, v. 6049, p. 338-349, 2010.
15. Hirsch, M.J. ; Pardalos, P.M. ; RESENDE, M. G. C. . Speeding up continuous GRASP?. European Journal of Operational Research, v. 205, p. 507-521, 2010.
16. Nascimento, Mariá C.V. ; Resende, Mauricio G.C. ; Toledo, Franklina M.B. . GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem?. European Journal of Operational Research, v. 200, p. 747-754, 2010.
17. Resende, M.G.C. ; Martí, R. ; Gallego, M. ; Duarte, A. . GRASP and path relinking for the max min diversity problem. Computers & Operations Research, v. 37, p. 498-508, 2010.
18. Fonseca, Margarida ; Figueira, José Rui ; Resende, Mauricio G.C. . Solving scalarized multi-objective network flow problems using an interior point method. International Transactions in Operational Research, v. 17, p. 607-636, 2010.
19. Reis, Roger ; Ritt, Marcus ; Buriol, Luciana S. ; Resende, Mauricio G. C. . A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. International Transactions in Operational Research, v. 18, p. 401-423, 2010.
20. Festa, P. ; RESENDE, M. G. C. . GRASP: basic components and enhancements. Telecommunications Systems, v. 46, p. 253-271, 2010.
21. Buriol, Luciana S. ; Hirsch, Michael J. ; Pardalos, Panos M. ; Querido, Tania ; Resende, Mauricio G. C. ; Ritt, Marcus . A biased random-key genetic algorithm for road congestion minimization. Optimization Letters, v. 4, p. 619-633, 2010.
22. Birgin, Ernesto G. ; Gozzi, Erico M. ; Resende, Mauricio G. C. ; Silva, Ricardo M. A. . Continuous GRASP with a local active-set method for bound-constrained global optimization. Journal of Global Optimization, v. 48, p. 289-310, 2010.
23. Hirsch, Michael J. ; Pardalos, Panos M. ; Resende, Mauricio G.C. . Solving systems of nonlinear equations with continuous GRASP. Nonlinear Analysis. Real World Applications, v. 10, p. 2000-2006, 2009.
24. Festa, Paola ; Resende, Mauricio G. C. . An annotated bibliography of GRASP - Part I: Algorithms. International Transactions in Operational Research, v. 16, p. 1-24, 2009.
25. Festa, Paola ; Resende, Mauricio G. C. . An annotated bibliography of GRASP-Part II: Applications. International Transactions in Operational Research, v. 16, p. 131-172, 2009.
26. MENDES, J ; GONCALVES, J ; RESENDE, M ; RESENDE, M. G. C. . A random key based genetic algorithm for the resource constrained project scheduling problem?. Computers & Operations Research, v. 36, p. 92-109, 2009.
27. da Cunha, Alexandre Salles ; Lucena, Abilio ; Maculan, Nelson ; Resende, Mauricio G.C. . A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs?. Discrete Applied Mathematics, v. 157, p. 1198-1217, 2009.
28. GONCALVES, J ; MENDES, J ; RESENDE, M ; RESENDE, M. G. C. . A genetic algorithm for the resource constrained multi-project scheduling problem. European Journal of Operational Research, v. 189, p. 1171-1190, 2008.
29. Portugal, L. F. ; RESENDE, M. G. C. ; Veiga, G. ; Júdice, Joaquim J. . Fortran subroutines for network flow optimization using an interior point algorithm. Pesquisa Operacional (Impresso), v. 28, p. 243-261, 2008.
30. NORONHA, T.F. ; RESENDE, M. G. C. ; Ribeiro, C. C. . Efficient implementations of heuristics for routing and wavelength assignment. Lecture Notes in Computer Science, v. 5038, p. 169-180, 2008.
31. ANDRADE, D. V. ; RESENDE, M. G. C. ; Werneck, Renato F. . Fast local search for the maximum independent set problem. Lecture Notes in Computer Science, v. 5038, p. 220-234, 2008.
32. Buriol, L. S. ; RESENDE, M. G. C. ; Thorup, M. . Speeding Up Dynamic Shortest-Path Algorithms. INFORMS Journal on Computing, v. 20, p. 191-204, 2007.
33. Hirsch, M. J. ; Meneses, C. N. ; Pardalos, P. M. ; RESENDE, M. G. C. . Global optimization by continuous grasp. Optimization Letters, v. 1, p. 201-212, 2007.
34.   Resende, Mauricio G. C. ; Werneck, Renato F. . A fast swap-based local search procedure for location problems. Annals of Operation Research, v. 150, p. 205-230, 2007.
35. Buriol, L.S. ; Resende, M.G.C. ; Thorup, M. . Survivable IP network design with OSPF routing. Networks (New York, N.Y. Print), v. 49, p. 51-64, 2007.
36. Aiex, Renata M. ; Resende, Mauricio G. C. ; Ribeiro, Celso C. . TTT plots: a perl program to create time-to-target plots. Optimization Letters, v. 1, p. 355-366, 2007.
37. Festa, Paola ; Pardalos, Panos M. ; Pitsoulis, Leonidas S. ; Resende, Mauricio G. C. . GRASP with path relinking for the weighted MAXSAT problem. ACM Journal of Experimental Algorithmics, v. 11, p. 2.4, 2007.
38. Oliveira, Carlos A. S. ; Pardalos, P. M. ; O. Prokopyev ; RESENDE, M. G. C. . Streaming cache placement problems: Complexity and algorithms. International Journal of Computational Science and Engineering, v. 3, p. 173-183, 2007.
39. Teixeira, Renata ; Griffin, Timothy G. ; Resende, Mauricio G. C. ; REXFORD, J. . TIE Breaking: Tunable Interdomain Egress Selection. IEEE/ACM Transactions on Networking, v. 15, p. 761-774, 2007.
40. RESENDE, M ; WERNECK, R ; RESENDE, M. G. C. . A hybrid multistart heuristic for the uncapacitated facility location problem. European Journal of Operational Research, v. 174, p. 54-68, 2006.
41. Buriol, L.S. ; Resende, M.G.C. ; Ribeiro, C.C. ; Thorup, M. . A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks (New York, N.Y. Print), v. 46, p. 36-56, 2005.
42. Aiex, Renata M. ; Resende, Mauricio G. C. ; Pardalos, Panos M. ; Toraldo, Gerardo . GRASP with Path Relinking for Three-Index Assignment. INFORMS Journal on Computing, v. 17, p. 224-247, 2005.
43. GONCALVES, J ; DEMAGALHAESMENDES, J ; RESENDE, M. G. C. . A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research, v. 167, p. 77-95, 2005.
44. Faria Jr., H. ; Binato, S. ; Resende, M.G.C. ; Falcao, D.M. . Power Transmission Network Design by Greedy Randomized Adaptive Path Relinking. IEEE Transactions on Power Systems, v. 20, p. 43-49, 2005.
45. Festa, P. ; Pardalos, P.M. ; Pitsoulis, Leonidas S. ; RESENDE, M. G. C. . GRASP with path-relinking for the weighted maximum satisfiability problem. Lecture Notes in Computer Science, v. 3503, p. 367-379, 2005.
46. GONCALVES, J ; RESENDE, M. G. C. . An evolutionary algorithm for manufacturing cell formation. Computers & Industrial Engineering, v. 47, p. 247-273, 2004.
47. LUCENA, A ; RESENDE, M. G. C. . Strong lower bounds for the prize collecting Steiner problem in graphs. Discrete Applied Mathematics, v. 141, p. 277-294, 2004.
48.   Resende, Mauricio G.C. ; Werneck, Renato F. . A Hybrid Heuristic for the p-Median Problem. Journal of Heuristics, v. 10, p. 59-88, 2004.
49. Oliveira, Carlos A. S. ; Pardalos, P. M. ; RESENDE, M. G. C. . GRASP with path-relinking for the quadratic assignment problem. Lecture Notes in Computer Science, v. 3059, p. 356-368, 2004.
50. Resende, Mauricio G. C. ; Veiga, Geraldo . An annotated bibliography of network interior point methods. Networks (New York, N.Y. Print), v. 42, p. 114-121, 2003.
51. Aiex, R ; RESENDE, M. G. C. . Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing, v. 29, p. 393-430, 2003.
52. Júdice, Joaquim J. ; Patricio, João ; Portugal, Luis F. ; Resende, Mauricio G.C. ; Veiga, Geraldo . A study of preconditioners for network interior point methods. Computational Optimization and Applications, v. 24, p. 5-35, 2003.
53. Resende, Mauricio G. C. ; Ribeiro, Celso C. . A GRASP with path-relinking for private virtual circuit routing. Networks (New York, N.Y. Print), v. 41, p. 104-114, 2003.
54. RESENDE, M. G. C. ; J. L. Gonzalez-Velarde . GRASP: Procedimientos de búsqueda miope aleatorizado y adaptatitvo. Inteligencia Artificial, v. 7, p. 61-76, 2003.
55. Festa, P. ; Pardalos, P. M. ; RESENDE, M. G. C. ; Ribeiro, C. C. . Randomized Heuristics for the Max-Cut Problem. Optimization Methods & Software, v. 17, p. 1033-1058, 2002.
56. Ericsson, M. ; Resende, M.G.C. ; Pardalos, P.M. . A genetic algorithm for the weight setting problem in OSPF routing. Journal of Combinatorial Optimization, v. 6, p. 299-333, 2002.
57. Aiex, Renata M. ; Resende, Mauricio G.C. ; Ribeiro, Celso C. . Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics, v. 8, p. 343-373, 2002.
58. Medeiros, Marcelo C ; Veiga, Alvaro ; RESENDE, M. G. C. . A Combinatorial Approach to Piecewise Linear Time Series Analysis. Journal of Computational and Graphical Statistics, v. 11, p. 236-258, 2002.
59. Abello, James ; SUDARSKY, S. ; RESENDE, M. G. C. . Massive quasi-clique detection. Lecture Notes in Computer Science, v. 2286, p. 598-612, 2002.
60. Canuto, S. A. ; RESENDE, M. G. C. ; Ribeiro, C. C. . Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks (New York, N.Y. Print), v. 38, p. 50-58, 2001.
61. Abello, James ; Butenko, Sergiy ; Pardalos, Panos M. ; Resende, Mauricio G.C. . Finding independent sets in a graph using continuous multivariable polynomial formulations. Journal of Global Optimization, v. 21, p. 111-137, 2001.
62. Festa, Paola ; Pardalos, Panos M. ; Resende, Mauricio G. C. . Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP. ACM Transactions on Mathematical Software, v. 27, p. 456-464, 2001.
63. Medeiros, Marcelo C. ; Resende, Mauricio G.C. ; Veiga, Alvaro . Piecewise linear time series estimation with GRASP. Computational Optimization and Applications, v. 19, p. 127-144, 2001.
64. Martins, S.L. ; RESENDE, M. G. C. ; Ribeiro, C. C. ; Pardalos, P. M. . A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy. Journal of Global Optimization, v. 17, p. 267-283, 2000.
65. Resende, Mauricio G.C. ; Pitsoulis, Leonidas S. ; Pardalos, Panos M. . Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP?. Discrete Applied Mathematics, v. 100, p. 95-113, 2000.
66. Portugal, L. F. ; RESENDE, M. G. C. ; Veiga, G. ; J?dice, J. J. . A truncated primal-infeasible dual-feasible network interior point method. Networks (New York, N.Y. Print), v. 35, p. 91-108, 2000.
67. Ribeiro, Celso C. ; Resende, Mauricio G. C. . Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. ACM Transactions on Mathematical Software, v. 25, p. 341-352, 1999.
68. Pardalos, Panos M. ; Qian, Tianbing ; Resende, Mauricio G.C. . A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem. Journal of Combinatorial Optimization, v. 2, p. 399-412, 1998.
69. Resende, Mauricio G.C. . Computing Approximate Solutions of the Maximum Covering Problem with GRASP. Journal of Heuristics, v. 4, p. 161-177, 1998.
70. Resende, Mauricio G. C. ; Feo, Thomas A. ; Smith, Stuart H. . Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP. ACM Transactions on Mathematical Software, v. 24, p. 386-394, 1998.
71. MAVRIDOU, T ; PARDALOS, P ; PITSOULIS, L ; RESENDE, M. G. C. . A GRASP for the biquadratic assignment problem. European Journal of Operational Research, v. 105, p. 613-621, 1998.
72. Pardalos, Panos M. ; Pitsoulis, Leonidas S. ; Resende, Mauricio G. C. . Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software, v. 23, p. 196-208, 1997.
73. Resende, Mauricio G. C. ; Ribeiro, Celso C. . A GRASP for graph planarization. Networks (New York, N.Y. Print), v. 29, p. 173-189, 1997.
74. Pardalos, P. M. ; Ramakrishnan, K. G. ; RESENDE, M. G. C. ; Li, Y. . Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem. SIAM Journal on Optimization, v. 7, p. 280, 1997.
75. Resende, Mauricio G. C. ; Pardalos, Panos M. ; Li, Yong . Algorithm 754; Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software, v. 22, p. 104-118, 1996.
76. Pardalos, P.M. ; Pitsoulis, Leonidas S. ; RESENDE, M. G. C. . A Parallel GRASP for MAX-SAT problems. Lecture Notes in Computer Science, v. 1184, p. 575-585, 1996.
77. Barr, Richard S. ; Golden, Bruce L. ; Kelly, James P. ; Resende, Mauricio G. C. ; Stewart, William R. . Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics, v. 1, p. 9-32, 1995.
78. RESENDE, M. G. C. ; Ramakrishnan, K. G. ; Drezner, Z. . Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming. Operations Research, v. 43, p. 781-791, 1995.
79. Feo, Thomas A. ; Resende, Mauricio G. C. . Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization, v. 6, p. 109-133, 1995.
80. MAVRIDOU, T ; Pardalos, P. M. ; Pitsoulis, Leonidas S. ; RESENDE, M. G. C. . Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP. Lecture Notes in Computer Science, v. 980, p. 317-331, 1995.
81. Li, Y. ; Pardalos, P. M. ; Ramakrishnan, K. G. ; RESENDE, M. G. C. . Lower bounds for the quadratic assignment problem. Annals of Operation Research, v. 50, p. 387-410, 1994.
82. Feo, T. A. ; RESENDE, M. G. C. ; Smith, S. H. . A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Operations Research, v. 42, p. 860-878, 1994.
83. Resende, Mauricio G. C. ; Veiga, Geraldo . An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks. SIAM Journal on Optimization, v. 3, p. 516-537, 1993.
84. RESENDE, M. G. C. ; Veiga, G. . Computing the projection in an interior point algorithm: An experimental comparison. Investigación Operativa, v. 3, p. 81-92, 1993.
85. Kamath, Anil P. ; Karmarkar, Narendra K. ; Ramakrishnan, K. G. ; Resende, Mauricio G. C. . A continuous approach to inductive inference. Mathematical Programming, v. 57, p. 215-238, 1992.
86. Karmarkar, Narendra ; Resende, Mauricio G. C. ; Ramakrishnan, K. G. . An interior point algorithm to solve computationally difficult set covering problems. Mathematical Programming, v. 52, p. 597-618, 1991.
87. Monteiro, R. D. C. ; Adler, I. ; RESENDE, M. G. C. . A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension. Mathematics of Operations Research, v. 15, p. 191-214, 1990.
88. Kamath, A. P. ; Karmarkar, N. K. ; Ramakrishnan, K. G. ; RESENDE, M. G. C. . Computational experience with an interior point algorithm on the satisfiability problem. Annals of Operation Research, v. 25, p. 43-58, 1990.
89.   Adler, Ilan ; Resende, Mauricio G. C. ; Veiga, Geraldo ; Karmarkar, Narendra . An implementation of Karmarkar's algorithm for linear programming. Mathematical Programming, v. 44, p. 297-335, 1989.
90. Adler, I. ; Karmarkar, N. ; RESENDE, M. G. C. ; Veiga, G. . Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm. INFORMS Journal on Computing, v. 1, p. 84-106, 1989.
91.   Feo, T ; RESENDE, M. G. C. . A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, v. 8, p. 67-71, 1989.
92. Glassey, C.R. ; Resende, M.G.C. . Closed-loop job release control for VLSI circuit manufacturing. IEEE Transactions on Semiconductor Manufacturing, v. 1, p. 36-46, 1988.
93. Glassey, C ; RESENDE, M. G. C. . A scheduling rule for job release in semiconductor fabrication. Operations Research Letters, v. 7, p. 213-217, 1988.
94. Resende, Mauricio G. C. . A Program for Reliability Evaluation of Undirected Networks via Polygon-to-Chain Reductions. IEEE Transactions on Reliability, v. 35, p. 24-29, 1986.
Livros publicados/organizados ou edições
1. RESENDE, M. G. C. ; Pardalos, P. M. . Handbook of Optimization in Telecommunications. Nova York: Springer Science+Business Media, 2006. v. 1. 1134 p.
2. RESENDE, M. G. C. ; SOUSA, J. P. . Metaheuristics: Computer Decision-Making. Boston: Kluwer Academic Publishers, 2004. v. 1. 736 p.
3.   Pardalos, P.M. ; RESENDE, M. G. C. . Handbook of Applied Optimization. Nova York: Oxford University Press, 2002. v. 1. 1095 p.
4. Abello, James ; Pardalos, Panos M. ; Resende, Mauricio G. C. . Handbook of Massive Datasets. Boston: Kluwer Academic Publishers, 2002. v. 1. 1236 p.
5. Pardalos, Panos M. ; Ramakrishnan, K. G. ; Resende, Mauricio G. C. . Parallel Processing of Discrete Optimization Problems. Providence, RI, EUA: American Mathematical Society, 1995. v. 1. 374 p.
Capítulos de livros publicados
1. Festa, P. ; RESENDE, M. G. C. . Effective application of GRASP. In: James J. Cochran, Louis Anthony Cox, Jr., Pinar Keskinocak, Jeffrey P. Kharoufeh, J. Cole Smith. (Org.). Wiley Encyclopedia of Operations Research and Management Science. Hoboken, NJ: John Wiley & Sons, 2011, v. 3, p. 1609-1617.
2. RESENDE, M. G. C. ; Silva, Ricardo M. A. . GRASP: Greedy randomized adaptive search procedures. In: James J. Cochran, Louis Anthony Cox, Jr., Pinar Keskinocak, Jeffrey P. Kharoufeh, J. Cole Smith. (Org.). Wiley Encyclopedia of Operations Research and Management Science. Hoboken, NJ: John Wiley & Sons, 2011, v. 3, p. 2118-2128.
3. Resende, Mauricio G. C. ; Ribeiro, Celso C. . Greedy randomized adaptive search procedures: Advances and applications. In: Gendreau, Michel; Potvin, Jean-Yves. (Org.). Handbook of Metaheuristics, 2nd Edition. 2 ed. New York: Springer Science+Business Media, 2010, v. , p. 281-317.
4. Resende, Mauricio G. C. ; Ribeiro, Celso C. ; Fred Glover ; Rafael Martí . Scatter search and path-relinking: Fundamentals, advances, and applications. In: Gendreau, Michel; Potvin, Jean-Yves. (Org.). Handbook of Metaheuristics, 2nd Edition. 2 ed. Nova York: Springer Science+Business Media, 2010, v. , p. 87-107.
5. Festa, Paola ; Resende, Mauricio G. C. . Hybrid GRASP Heuristics. In: Ajith Abraham; Aboul-Ella Hassanien; Patrick Siarry; Andries Engelbrecht. (Org.). Foundations of Computational Intelligence. Nova York: Springer Science+Business Media, 2010, v. 3, p. 75-100.
6. Resende, Mauricio G. C. . Metaheuristic hybridization with Greedy Randomized Adaptive Search Procedures. In: Zhi-Long Chen; S. Raghavan. (Org.). Tutorials in Operations Research. Hanover, Maryland, EUA: INFORMS, 2008, v. 2008, p. 295-319.
7. C. Commander ; Festa, P. ; Oliveira, Carlos A. S. ; Pardalos, P. M. ; RESENDE, M. G. C. ; M. Tsitselis . GRASP with path-relinking for the cooperative communication problem on ad hoc networks. In: D.A. Grundel; R.A. Murphey; P.M. Pardalos; O.A. Prokopyev. (Org.). Cooperative Networks: Control and Optimization. Northampton MA EUA: Edward Elgar Publishing Inc, 2008, v. , p. 187-207.
8. Hirsch, Michael J. ; Meneses, C. N. ; Pardalos, Panos M. ; Michelle Ragle ; Resende, Mauricio G. C. . A continuous GRASP to determine the relationship between drugs and adverse reactions. In: O. Seref; O.Erhun Kundakcioglu; P.M. Pardalos. (Org.). Data mining, systems analysis, and optimization in biomedicine. Melville, NY, EUA: American Institute of Physics, 2007, v. 953, p. 106-121.
9. RESENDE, M. G. C. ; Ribeiro, C. C. . Parallel Greedy Randomized Adaptive Search Procedures. In: Enrique Alba. (Org.). Parallel Metaheuristics: A New Class of Algorithms. Hoboken, NJ EUA: Wiley, 2005, v. , p. 315-346.
10. Aiex, Renata M. ; Resende, Mauricio G. C. . Parallel strategies for GRASP with path-relinking. In: T. Ibaraki; K. Nonobe; M. Yagiura. (Org.). Metaheuristics: Progress as Real Problem Solvers. New York: Springer Science+Business Media, 2005, v. , p. 301-331.
11. Resende, Mauricio G. C. ; Ribeiro, Celso C. . GRASP with path-relinking: Recent advances and applications. In: T. Ibaraki; K. Nonobe; M. Yagiura. (Org.). Metaheuristics: Progress as Real Problem Solvers. New York: Springer Science+Business Media, 2005, v. , p. 29-63.
12. Resende, Mauricio G. C. . Combinatorial optimization in telecommunications. In: P.M. Pardalos; V. Korotkich. (Org.). Optimization and Industry: New Frontiers. Boston, MA EUA: Kluwer Academic Publishers, 2003, v. , p. 59-112.
13. Resende, Mauricio G. C. ; Ribeiro, Celso C. . Greedy randomized adaptive search procedures. In: F. Glover; G. Kochenberger. (Org.). Handbook of Metaheuristics. 1 ed. Norwell, MA EUA: Kluwer Academic Publishers, 2003, v. , p. 219-249.
14. Pitsoulis, Leonidas S. ; Resende, Mauricio G. C. . Greedy randomized adaptive search procedures. In: P.M. Pardalos; M.G.C. Resende. (Org.). Handbook of Applied Optimization. New York: Oxford University Press, 2002, v. , p. 168-183.
15. S. Duni Ekisoglu ; Pardalos, Panos M. ; Resende, Mauricio G. C. . Parallel metaheuristics for combinatorial optimization. In: Correa, R.; Castro Dutra, I.; Fiallos, M.; Silva, L.F.G.. (Org.). Models for Parallel and Distributed Computation. Norwell, MA EUA: Kluwer Academic Publishers, 2002, v. , p. 179-206.
16. Festa, Paola ; Resende, Mauricio G. C. . GRASP: An annotated bibliography. In: Ribeiro, Celso C.; Hansen, Pierre. (Org.). Essays and Surveys in Metaheuristics. Norwell, MA EUA: Kluwer Academic Publishers, 2002, v. , p. 325-367.
17. Ramakrishnan, K. G. ; RESENDE, M. G. C. ; B. Ramachandran ; J.F. Pekny . Tight QAP bounds via linear programming. In: P.M. Pardalos; A. Migdalas; R.E. Burkard. (Org.). Combinatorial and Global Optimization. Singapura: World Scientific, 2002, v. , p. 297-303.
18. Festa, P. ; Pardalos, P. M. ; RESENDE, M. G. C. . Feedback set problems. In: C.A. Floudas; P.M. Pardalos. (Org.). Encyclopedia of Optimization. Norwell, MA EUA: Kluwer Academic Publishers, 2001, v. 2, p. 94-106.
19. Resende, Mauricio G. C. . Greedy randomized adaptive search procedures (GRASP). In: C.A. Floudas; P.M. Pardalos. (Org.). Encyclopedia of Optimization. Norwell, MA EUA: Kluwer Academic Publishers, 2001, v. 2, p. 373-382.
20. Resende, Mauricio G. C. ; Ribeiro, Celso C. . Graph planarization. In: C.A. Floudas; P.M. Pardalos. (Org.). Graph planarization. Norwell, MA EUA: Kluwer Academic Publishers, 2001, v. 2, p. 368-373.
21. Festa, Paola ; Pardalos, Panos M. ; Resende, Mauricio G. C. . Feedback set problems. In: D.-Z. Du; P.M. Pardalos. (Org.). Handbook of Combinatorial Optimization. Norwell, MA EUA: Kluwer Academic Publishers, 2000, v. A, p. 209-259.
22. MURPHEY, R. A. ; Pardalos, P. M. ; RESENDE, M. G. C. . Frequency assignment problems. In: D.-Z. Du; P.M. Pardalos. (Org.). Frequency assignment problems. Norwell, MA EUA: Kluwer Academic Publishers, 2000, v. A, p. 295-377.
23. X. Liu ; Pardalos, P.M. ; S. Rajasekaran ; RESENDE, M. G. C. . A GRASP for frequency assignment in mobile radio networks. In: S. Rajasekaran; P. M. Pardalos; D.F. Hsu. (Org.). Mobile Networks and Computing. Providence, RI, EUA: American Mathematical Society, 2000, v. 52, p. 195-202.
24. Abello, James ; Pardalos, Panos M. ; Resende, Mauricio G. C. . On maximum cliques problems in very large graphs. In: J. Abello; J. Vitter. (Org.). External memory algorithms. Providence, RI, EUA: American Mathematical Society, 1999, v. 50, p. 119-130.
25. MARTINS, S. L. ; Pardalos, P.M. ; RESENDE, M. G. C. ; Ribeiro, C.C. . Greedy randomized adaptive search procedures for the Steiner problem in graphs. In: P.M. Pardalos; S. Rajasekaran; J. Rolim. (Org.). Randomization methods in algorithm design. Providence, RI, EUA: American Mathematical Society, 1999, v. 43, p. 133-145.
26. Pardalos, P. M. ; Rappe, J. ; RESENDE, M. G. C. . An exact parallel algorithm for the maxium clique problem. In: Leone, R.; Murli, A.; Pardalos, P.M.; Toraldo, G.. (Org.). High performance algorithms and software in nonlinear optimization. Norwell, MA EUA: Kluwer Academic Publishers, 1999, v. , p. 279-300.
27. Mitchell, J.E. ; Pardalos, P. M. ; RESENDE, M. G. C. . Interior point methods for combinatorial optimization. In: D.-Z. Du; P.M. Pardalos. (Org.). Handbook of Combinatorial Optimization. Norwell, MA EUA: Kluwer Academic Publishers, 1998, v. 1, p. 189-298.
28. RESENDE, M. G. C. ; Pitsoulis, Leonidas S. ; Pardalos, P. M. . Approximate Solution of Weighted MAX-SAT Problems using GRASP. In: D.-Z. Du; J. Gu; P.M. Pardalos. (Org.). Satisfiability Problem: Theory and Applications. Providence, RI, EUA: American Mathematical Society, 1997, v. 35, p. 393-405.
29. Pardalos, P. M. ; RESENDE, M. G. C. . Interior point methods for global optimization. In: T. Terlaky. (Org.). Interior point methods in mathematical programming. Norwell, MA EUA: Kluwer Academic Publishers, 1996, v. , p. 467-500.
30. Ramakrishnan, K. G. ; RESENDE, M. G. C. ; Pardalos, P.M. . A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming. In: C.A. Floudas; P.M. Pardalos. (Org.). State of the Art in Global Optimization: Computational Methods and Applications. Norwell, MA EUA: Kluwer Academic Publishers, 1996, v. , p. 57-73.
31. RESENDE, M. G. C. ; Feo, T. A. . A GRASP for Satisfiability. In: D. S. Johnson; M. A. Trick. (Org.). Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. Providence, RI, EUA: American Mathematical Society, 1996, v. 26, p. 499-520.
32. Li, Y. ; Pardalos, P.M. ; RESENDE, M. G. C. . A greedy randomized adaptive search procedure for the quadratic assignment problem. In: P.M. Pardalos; H. Wolkowicz. (Org.). Quadratic assignment and related problems. Providence, RI, EUA: American Mathematical Society, 1994, v. 16, p. 237-261.
33. RESENDE, M. G. C. ; Veiga, G. ; TSUCHIYA, T. . Identifying the optimal face of a network linear program with a globally convergent interior point method. In: W.W. Hager; D.W. Hearn; P.M. Pardalos. (Org.). Large Scale Optimization: State of the Art. Norwell, MA EUA: Kluwer Academic Publishers, 1994, v. , p. 362-387.
Trabalhos completos publicados em anais de congressos
1. Lee Breslau ; Ilias Diakonikolas ; DUFFIELD, N. ; Yu Gu ; HAJIAGHAYI, M. ; David S. Johnson ; KARLOFF, H. ; RESENDE, M. G. C. ; SEN, S. . Disjoint-path facility location: Theory and practice. In: Thirteenth Workshop of Algorithm Engineering and Experiments (ALENEX11), 2011, San Francisco, California, EUA. Proceedings of the Thirteenth Workshop of Algorithm Engineering and Experiments (ALENEX11). Philadelphia, PA, EUA : Society for Industrial and Applied Mathematics (SIAM), 2011. p. 60-74.
2. Buriol, L. S. ; Hirsch, M. J. ; Pardalos, P.M. ; QUERIDO, T. ; RESENDE, M. G. C. ; RITT, M. . A hybrid genetic algorithm for road congestion minimization. In: XLI Simpósio Brasileiro de Pesquisa Operacional, 2009, Porto Seguro, BA. Anais do XLI Simpósio Brasileiro de Pesquisa Operacional. Rio de Janeiro : SOBRAPO, 2009. p. 2515-2526.
Artigos aceitos para publicação
1. Pessoa, Luciana S. ; RESENDE, M. G. C. ; Ribeiro, Celso C. . A hybrid Lagrangean heuristic with GRASP and path-relinking for set K-covering. Computers & Operations Research, 2012.
2. RAVETTI, M. G. ; C. Riveros ; A. Mendes ; Resende, M.G.C. ; Pardalos, P. M. . Parallel hybrid heuristics for the permutation flow shop problem. Annals of Operation Research, 2012.
3. ANDRADE, D. V. ; Resende, M.G.C. ; Werneck, Renato F. . Fast local search for the maximum independent set problem. Journal of Heuristics, 2012.
4. Resende, Mauricio G. C. ; Toso, Rodrigo F. ; Gonçalves, José Fernando ; Silva, Ricardo M. A. . A biased random-key genetic algorithm for the Steiner triple covering problem. Optimization Letters, 2011.
5. RESENDE, M. G. C. . Biased random-key genetic algorithms with applications in telecommunications. Top (Madrid), 2011.
6. Ribeiro, C.C. ; RESENDE, M. G. C. . Path-relinking intensification methods for stochastic local search algorithms. Journal of Heuristics, 2011.
Produção técnica
Demais tipos de produção técnica
1. ANDRADE, D. V. ; Buriol, Luciana S. ; Resende, Mauricio G. C. ; Thorup, M. . U.S. Patent 8,098,679: Method and apparatus for providing composite link assignment in network design. 2012. (Patente).
2. Griffin, Timothy G. ; Rexford, Jennifer ; Resende, Mauricio G. C. ; Renata Teixeira . U.S. Patent 7,904,586: Traffic engineering method with tunable inter-domain egress selection. 2011. (Patente).
3. Resende, Mauricio G. C. . U.S. Patent 7,924,729: Determining a minimum cost solution for resolving covering-by-pairs problem. 2011. (Patente).
4. Hirsch, Michael J. ; Pardalos, Panos M. ; Resende, Mauricio G. C. . U.S. Patent 7,974,816: Sensor registration by global optimization procedures. 2011. (Patente).
5. Resende, Mauricio G. C. ; da Cunha, Alexandre Salles ; Lucena, Abilio ; Maculan, Nelson . U.S. Patent 7,978,629: Method for network design to maximize difference of revenue and network cost. 2011. (Patente).
6. Hirsch, M.J. ; Pardalos, P. M. ; RESENDE, M. G. C. . U.S. Patent 7,653,513: Sensor registration by global optimization. 2010. (Patente).
7. Resende, Mauricio G. C. ; ANDRADE, D. V. . U.S. Patent 7,826,607: Devices, systems, and methods for migration scheduling. 2010. (Patente).
8. Griffin, Timothy G. ; RESENDE, M. G. C. ; Rexford, Jennifer ; Teixeira, Renata . U.S. Patent 7,581,022: Method for tunable inter-domain egress selection. 2009. (Patente).
9. Buriol, L. S. ; RESENDE, M. G. C. ; Thorup, M. . U.S. Patent 7,593,341: Method and apparatus for updating a shortest path graph. 2009. (Patente).
10. ANDRADE, D. V. ; Buriol, L. S. ; RESENDE, M. G. C. ; Thorup, M. . U.S. Patent 7,599,385: Method and apparatus for providing composite link assignment in network design. 2009. (Patente).

Orientações
Orientações em andamento
Orientações de outra natureza
1. Rodrigo Franco Toso. Design of metropolitan area networks. Início: 2010. Orientação de outra natureza. The State University of New Jersey. (Orientador).
Supervisões e orientações concluídas
Tese de doutorado
1. Cristian Alejandro Martinez. Metaheurísticas híbridas aplicadas al problema de ruteo de arcos capacidado. 2011. Tese (Doutorado em Doutorado em Ciências da Computação) - Universidad de Buenos Aires, . Co-Orientador: Mauricio Guilherme de Carvalho Resende.
2. Thiago Ferreira de Noronha. Algoritmos para Problemas de Otimização Aplicados Roteamento e Atribuição de Comprimentos de Onda. 2008. Tese (Doutorado em Informática) - Pontifícia Universidade Católica do Rio de Janeiro, Conselho Nacional de Desenvolvimento Científico e Tecnológico. Co-Orientador: Mauricio Guilherme de Carvalho Resende.
3. Luciana Salete Buriol. Roteamento do Tráfego na Internet: Algoritmos para Projeto e Operação de Redes com Protocolo OSPF. 2003. Tese (Doutorado em Doutorado em Engenharia Elétrica) - Universidade Estadual de Campinas, . Co-Orientador: Mauricio Guilherme de Carvalho Resende.
4. Renata Machado Aiex. Uma investigação experimental da distribuição de probabilidade do tempo de solução em heurísticas GRASP e sua aplicação na análise de implementações paralelas. 2002. Tese (Doutorado em Informática) - Pontifícia Universidade Católica do Rio de Janeiro, Conselho Nacional de Desenvolvimento Científico e Tecnológico. Co-Orientador: Mauricio Guilherme de Carvalho Resende.
Supervisão de pós-doutorado
1. Ricardo Martins de Abreu SIlva. 2010. Universidade Federal de Lavras, Conselho Nacional de Desenvolvimento Científico e Tecnológico. Mauricio Guilherme de Carvalho Resende.
2. Ana Viana. 2007. Instituto de Engenharia e Sistemas de Computadores do Porto, . Mauricio Guilherme de Carvalho Resende.
3. Paola Festa. 2003. Università degli Studi di Napoli Federico lI, . Mauricio Guilherme de Carvalho Resende.
4. Celso Carneiro Ribeiro. 2001. Pontifícia Universidade Católica do Rio de Janeiro, Conselho Nacional de Desenvolvimento Científico e Tecnológico. Mauricio Guilherme de Carvalho Resende.
Orientações de outra natureza
1. Rodrigo Franco Toso. Combinatorial optimization with biased random-key genetic algorithms. 2011. Orientação de outra natureza. (Estágio nível doutorado) - AT&T Labs Research. Orientador: Mauricio Guilherme de Carvalho Resende.
2. Luciana de Souza Pessôa. Heurísticas para o problema de k-cobertura de conjuntos. 2009. Orientação de outra natureza - Universidade Federal Fluminense. Orientador: Mauricio Guilherme de Carvalho Resende.
3. Diogo V. Andrade. GRASP with path-relinking for network migration scheduling. 2005. Orientação de outra natureza - The State University of New Jersey. Orientador: Mauricio Guilherme de Carvalho Resende.
4. Renato F. Werneck. A hybrid multistart heuristic for the uncapacitated facility location problem. 2003. Orientação de outra natureza - Princeton University. Orientador: Mauricio Guilherme de Carvalho Resende.
5. Renato F. Werneck. A Hybrid Heuristic for the p-Median Problem. 2002. Orientação de outra natureza - Princeton University. Orientador: Mauricio Guilherme de Carvalho Resende.
6. Rachel Rubin. Mining telephone call graphs. 1999. Orientação de outra natureza - Amherst College. Orientador: Mauricio Guilherme de Carvalho Resende.
7. Illya Hicks. Implementation of new preconditioners for interior point methods for linear programming. 1996. Orientação de outra natureza - Rice University. Orientador: Mauricio Guilherme de Carvalho Resende.
8. Silvio Binato. A GRASP for job shop scheduling. 1996. Orientação de outra natureza - Centro de Pesquisas de Energia Elétrica, Conselho Nacional de Desenvolvimento Científico e Tecnológico. Orientador: Mauricio Guilherme de Carvalho Resende.
Página gerada pelo Sistema Currículo Lattes em 09/02/2012 às 5:03:32