Most cited papers of Mauricio G. C. Resende on ISI
web of science ~ isiknowledge.com
These papers are used to compute Mauricio G. C. Resende's (ISI web of science) h-index of 19.
last updated: 28 January 2009
01) T.A. Feo and M.G.C. Resende, Greedy
randomized adaptive search procedures, J.
of Global Optimization, vol. 6, pp.
109--133, 1995 - 229 citations:
2009 (4), 2008 (26), 2007 (24), 2006
(20), 2005 (29), 2004 (18), 2003 (23), 2002 (20), 2001 (23), 2000 (8),
1999 (11), 1998 (12), 1997 (6), 1996 (2). [ Google Scholar citations: 772 ]
02) 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; Also Technical Report ORC 86-8, Operations Research
Center, University of California, Berkeley, 1986 - 168 citations:
2008 (3), 2007 (5), 2006 (3), 2005(3), 2004(3), 2003(3), 2002 (6), 2001 (6), 2000
(9), 1999 (4), 1998 (7), 1997 (7), 1996
(16), 1995 (10), 1994 (11), 1993 (16), 1992 (8), 1991 (20),1990 (9),
1989 (13), 1988 (2), 1987 (3), 1986 (1). [ Google Scholar citations: 295 ]
03) 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 - 121 citations: 2009 (3), 2008 (8), 2007 (6), 2006 (7),
2005 (5),
2004 (8), 2003 (9), 2002 (14), 2001 (8), 2000 (1), 1999 (6), 1998 (10),
1997 (8), 1996 (11), 1995 (1), 1994 (7), 1993 (1), 1992
(6), 1990 (2), 1989 (1). [ Google Scholar citations: 214 ]
04) 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 - 113 citations: 2009 (2), 2008 (11), 2007 (10), 2006 (7), 2005 (14), 2004 (7), 2003 (8), 2002 (12), 2001
(8), 2000 (4), 1999 (4), 1998 (6),1997 (1), 1996 (6), 1995 (5), 1994
(3), 1993 (1), 1991 (3). [ Google Scholar citations: 301 ]
05) 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 - 73
citations: 2008 (2), 2007 (4), 2006(3),
2005(3), 2004 (3), 2003 (1), 2002 (4), 2001 (2), 2000 (1), 1999
(7), 1998 (6), 1997 (6), 1996 (7), 1995
(1), 1994 (3), 1993 (8), 1992 (6), 1991 (6). [ Google Scholar citations: 142 ]
06) R.S. Barr, B.L. Golden, J.P. Kelly, M.G.C. Resende,
and W.R. Stewart, Designing
and reporting on computational experiments with heuristic methods, J. of Heuristics, vol. 1, pp.
9-32, 1995 - 71 citations: 2009 (1), 2008 (6), 2007 (5), 2006 (6), 2005 (5), 2004 (6), 2003 (9),
2002 (12), 2001 (7), 2000 (6), 1999 (3), 1998 (2), 1997 (1), 1996
(1). [ Google Scholar citations: 227 ]
07) 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 - 52
citations: 2008 (4), 2007 (3), 2006 (4), 2005 (6), 2004 (6), 2003 (3),
2002 (4), 2001 (4), 2000 (1), 1999 (4), 1998
(6), 1997 (4), 1996 (1), 1995 (1), 1994 (2). [ Google Scholar citations: 160 ]
08) P.M. Pardalos and M.G.C. Resende, Handbook of applied optimization, Oxford University Press, New York, 2002 - 46 citations: 2009 (1), 2008 (9), 2007 (8), 2006 (9), 2005 (7), 2004 (5), 2003 (4), 2002 (3). [ Google Scholar citations: 148 ]
09) Y. Li, P.M. Pardalos, and M.G.C. Resende, A greedy
randomized adaptive search procedure for the quadratic assignment
problem,Quadratic assignment
and related problems, P.M. Pardalos and H. Wolkowicz, eds., DIMACS Series on Discrete Mathematics
and Theoretical Computer Science, vol. 16, pp. 237-261, 1994 - 44
citations: 2008 (2), 2007 (6), 2006 (1), 2005 (3), 2004 (3), 2003 (4), 2002 (3),
2001 (4), 2000 (1), 1999 (5), 1998 (5), 1997 (6), 1996 (1). [ Google Scholar citations: 130 ]
10) M.G.C. Resende and C.C. Ribeiro, Greedy randomized adaptive search procedures, in Handbook of Metaheuristics, F. Glover and G. Kochenberger, eds., Kluwer
Academic Publishers, pp. 219-249, 2003 - 42 citations: 2009 (2), 2008 (9), 2007 (9), 2006 (9), 2005 (9), 2004 (4). [ Google Scholar citations: 313 ]
11) I. Adler, N.K. Karmarkar, M.G.C. Resende, and G.
Veiga, Data
structures and programming techniques for the implementation of
Karmarkar's algorithm, ORSA
J.
on Computing, vol. 1, pp. 84-106, 1989; Also Technical Report,
Department of Industrial Engineering and Operations Research,
University of California, Berkeley, 1987 - 38 citations: 2008 (1), 2007 (1), 2004 (2), 2003 (1), 2002 (1), 2000 (1).
1999 (2), 1998 (1), 1996 (4), 1995 (2), 1994 (1), 1993 (6), 1992 (4),
1991 (6), 1990 (3), 1989 (2). [ Google Scholar citations: 80 ]
12) 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 - 37 citations: 2009 (1), 2008 (4), 2007 (2), 2006 (3),
2005 (1),
2004 (2), 2003 (5), 2002 (5), 2001 (3), 1998 (3),
1997 (3), 1995 (1), 1994 (3), 1992
(2). [ Google Scholar citations: 57 ]
13) 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 - 30 citations: 2008 (2), 2007 (2), 2005 (1), 2004 (4), 2003 (3), 2002 (1), 2001 (4), 2000 (4), 1999 (2), 1998 (5), 1997 (2). [ Google Scholar citations: 67 ]
14) 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 citations: 2005
(3), 2004 (3), 2003 (3), 2002 (2), 2001 (3), 2000 (1), 1999 (1), 1998
(6), 1997 (1), 1996 (3), 1995 (1), 1994 (2). [ Google Scholar citations: 81 ]
15) N. 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 - 27 citations: 2007 (1), 2002 (1), 2001 (3), 2000 (1), 1998 (5), 1997 (4), 1996 (4), 1995 (3), 1994 (1), 1993 (1), 1992 (2). [ Google Scholar citations: 64 ]
16) 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 - 27 citations: 2008 (3), 2007 (9), 2006 (4), 2005 (7), 2004 (3), 2002 (1). [ Google Scholar citations: 128 ]
17) 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 - 26 citations: 2009 (2). 2008 (7), 2007 (5), 2006 (5), 2005 (4), 2004 (3). [ Google Scholar citations: 91 ]
18) M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos, Approximate Solution of Weighted MAX-SAT Problems
using GRASP, DIMACS Series on Discrete Mathematics and
Theoretical Computer Science, vol. 35, pp. 393-405, 1997 - 22 citations: 2008 (2), 2007 (1), 2006 (2), 2005 (1), 2004 (1), 2003 (6), 2002 (1), 2001 (3), 2000 (3), 1999 (1), 1998 (1). [ Google Scholar citations: 64 ]
19) A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan, and
M.G.C. Resende, Computational experience with an interior point
algorithm on the satisfiability problem, Annals of Operations
Research, vol. 25, pp. 43-58, 1990 - 21 citations:
2007 (1), 2005 (2), 2003 (2), 2002 (1), 2000 (1), 1999 (1), 1998 (2),
1997 (2),1996 (5), 1995 (1), 1994 (2), 1992 (1). [ Google Scholar citations: 83 ]
20) 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 - 20 citations: 2009 (5), 2008 (10), 2007 (2), 2006 (3). [ Google Scholar citations: 95 ]
21) M.G.C. Resende, P.M. Pardalos, Y. Li, Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP, ACM Trans. on Mathematical Software, vol. 22, pp.104-118, 1996 - 19 citations: 2007 (2), 2005 (1), 2004 (1), 2003 (2), 2002 (3), 2001 (2), 2000 (2), 1999 (1), 1998 (2), 1997 (3). [ Google Scholar citations: 48 ]
22) 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 - 19 citations: 2009 (1), 2008 (2), 2007 (1), 2006 (6), 2005 (1), 2004 (3), 2003 (2), 2002 (3). [ Google Scholar citations: 86 ]