Most cited papers of Mauricio G. C. Resende on ISI web of science
These papers are used to compute Mauricio G. C. Resende's (ISI web of science) h-index of 31.
last updated: 29 December 2015
01) [ 734 ISI citations ] T.A. Feo and M.G.C. Resende, "Greedy
randomized adaptive search procedures," J. of Global Optimization, vol. 6, pp. 109-133, 1995
02) [ 339 ISI citations ] T.A. Feo and M.G.C. Resende, "A probabilistic heuristic for a computationally difficult set covering problem," Operations
Research Letters, vol. 8, pp. 67-71, 1989
03) [ 188 ISI citations ] C.R. Glassey and M.G.C. Resende, "Closed-loop job release control for VLSI circuit manufacturing," IEEE Transactions on Semiconductor Manufacturing, vol. 1, pp. 36-46,1988
04) [ 174 ISI citations ] J.F. Gonçalves, J.J.D.M. Mendes, and M.G.C. Resende, "A hybrid genetic algorithm for the job shop scheduling problem," European J. of Operational Research, vol. 167, pp. 77-95, 2005
05) [ 161 ISI citations ] I. Adler, M.G.C. Resende, G. Veiga, and N.K. Karmarkar, "An implementation of Karmarkar's algorithm for linear programming," Mathematical Programming, vol. 44, pp. 297-335, 1989
06) [ 123 ISI citations ] T.A. Feo, M.G.C. Resende, and S.H. Smith, "A greedy randomized adaptive search procedure for maximum independent set, Operations Research," vol. 42, pp. 860-878, 1994
07) [ 107 ISI citations ] M. Ericsson, M.G.C. Resende, P.M. Pardalos, "A genetic algorithm for the weight setting problem in OSPF routing," J. of Combinatorial Optimization, vol. 6, pp. 299-333, 2002
08) [ 98 ISI citations ] R.M. Aiex, S. Binato, and M.G.C. Resende, "Parallel GRASP with path-relinking for job shop scheduling," Parallel Computing, vol. 29, pp. 393-430, 2003
09) [ 97 ISI citations ] M.G.C. Resende and R.F. Werneck, "A hybrid heuristic for the p-median problem," J. of Heuristics, vol. 10, pp. 59-88, 2004
10) [ 90 ISI citations ] J.F. Gonçalves and M.G.C. Resende, "An evolutionary algorithm for manufacturing cell formation," Computers and Industrial Engineering. vol. 47, pp. 247-273, 2004
11) [ 87 ISI citations ] R.D.C. Monteiro, I. Adler, and M.G.C. Resende, "A polynomial-time primal-dual affine scaling algorithm for linearand convex quadratic programming and its power series extension," Mathematics of Operations Research, vol. 15, pp. 191-214, 1990
12) [ 76 ISI citations ] J.J.M. Mendes, J.F. Gonçalves, and M.G.C. Resende, "A random key based genetic algorithm for the resource constrained project scheduling problem," Computers and Operations Research, vol. 36, pp. 92-109, 2009
13) [ 70 ISI citations ] C.R. Glassey and M.G.C. Resende, "A scheduling rule for job release in semiconductor fabrication," Operations Research Letters, vol. 7, pp. 213-217, 1988
14) [ 69 ISI citations ] J.F. Gonçalves, J.J.M. Mendes, and M.G.C. Resende, "A genetic algorithm for the resource constrained multi-project scheduling problem," European J. of Operational Research, vol. 189, pp. 1171-1190, 2008
15) [ 60 ISI citations ] R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro, "Probability distribution of solution time in GRASP: An experimental investigation," J. of Heuristics, vol. 8, pp. 343-373, 2002
16) [ 54 ISI citations ] S.A. Canuto, M.G.C. Resende, C.C. Ribeiro, "Local search with perturbations for the prize-collecting Steiner tree problem in graphs," Networks, vol. 38, pp.50-58, 2001
17) [ 49 ISI citations ] M.G.C. Resende, R. Martí, M. Gallego, A. Duarte, "A GRASP and path relinking forthe max min diversity problem," Computers & Operations Research, vol. 37, pp. 498-508, 2010.,
18) [ 49 ISI citations ] M.J. Hirsch, C.N. Meneses, P.M. Pardalos, and M.G.C. Resende, "Global optimization by continuous GRASP," Optimization Letters, vol. 1, pp. 201-212, 2007
19) [48 ISI citations ] J.F. Gonçalves and M.G.C. Resende, "Biased random-key genetic algorithms for combinatorial optimization," J. of Heuristics, vol. 17, pp. 487-525, 2011
20) [ 47 ISI citations ] P. Festa and M.G.C. Resende, "An annotated bibliography of GRASP - Part I: Algorithms," International Transactions in Operational Research," vol. 16, pp. 1-24, 2009
21) [ 46 ISI citations ] L.S. Buriol, M.G.C. Resende, Celso C. Ribeiro, and M. Thorup, "" hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing," Networks, vol. 46, no. 1, pp. 36-56, 2005
22) [ 46 ISI citations ] R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo, "GRASP with path relinking for three-index assignment," INFORMS J. on Computing, vol. 17, no. 2, pp. 224-247, 2005
23) [ 44 ISI citations ] M. G. C. Resende and C. C. Ribeiro, "A GRASP with path-relinking for private virtual circuit routing," Networks, vol. 41, pp. 104-114, 2003
24)
[ 42 ISI citations ] P. Festa and M.G.C. Resende, "An annotated bibliography of GRASP - Part II: Applications," International Transactions in Operational Research," vol. 16, pp. 131-172, 2009
25) [ 42 ISI citations ] M.G.C. Resende, K.G. Ramakrishnan, and Z. Drezner, "Computing lower bounds for the quadratic assignment problem with an interior-point algorithm for linear programming," Operations Research, vol. 43, pp. 781-791, 1995
26) [ 41 ISI citations ] R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro, "TTT plots: a perl program to create time-to-target plots," Optimization Letters, vol. 1, pp. 355-366, 2007
27) [ 41 ISI citations ] J. Abello, M.G.C. Resende, and S. Sudarsky, "Massive quasi-clique detection," Lecture Notes in Computer Science, vol. 2286, pp. 598-612, 2002
28) [ 36 ISI citations ] A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan, and M.G.C. Resende, "A continuous approach to inductive inference," Mathematical Programming, vol. 57, pp. 215-238, 1992
29) [33 ISI citations ] M.G.C. Resende and R.F. Werneck, "A hybrid multistart heuristic for the uncapacitated facility location problem," European J. of Operational Research, vol. 174, pp. 54-68, 2006
30) [ 32 ISI citations ] N.K. Karmarkar, M.G.C. Resende, and K.G. Ramakrishnan, "An interior point algorithm to solve computationally difficult set covering problems," Mathematical Programming, vol. 52 , pp. 597-618,1991
31) [ 31 ISI citations ] M.G.C. Resende and C.C. Ribeiro, "A GRASP for graph planarization," Networks, vol. 29, pp. 173-189, 1997