updated: August 13, 2009

Publications used to compute Mauricio G. C. Resende's (Google Scholar) h-index of 45

01) [ Google Scholar citations: 1034 ]  T.A. Feo and M.G.C. Resende, Greedy randomized adaptive search procedures, J. of Global Optimization, vol. 6, pp. 109-133, 1995.  

02) [ Google Scholar citations: 403 ]  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.

03) [ Google Scholar citations: 383 ]  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.

04) [ Google Scholar citations: 322 ]  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.

05) [ Google Scholar citations: 245 ]  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.

06) [ Google Scholar citations: 230 ] 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.

07) [ Google Scholar citations: 185 ]  P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization, Oxford University Press, 2002.

08) [ Google Scholar citations: 175 ]  P. Festa and M.G.C. Resende, GRASP: An annotated bibliography, Essays and Surveys on Metaheuristics, C.C. Ribeiro and P. Hansen, Eds., Kluwer Academic Publishers, pp. 325-367, 2002.

09) [ Google Scholar citations: 168 ] 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.

10) [ Google Scholar citations: 158 ]  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, vol. 6, pp. 299-333, 2002.

11) [ Google Scholar citations: 146 ]  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. 

12) [ Google Scholar citations: 138 ]  J.F. Gonçalves, J.J.M.Mendes,  and M. G. C. Resende, A hybrid genetic algorithm for job shop scheduling, European J. of Operacional Research, vol. 167, pp. 77-95, 2005.

13) [ Google Scholar citations: 136 ]  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. 

14) [ Google Scholar citations: 102 ]  J. Abello, P.M. Pardalos, and M.G.C. Resende, On maximum cliques in very large graphs, in "External memory aglrotihms," J. Abello and J. Vitter (eds.), DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 50, pp. 119-130, American Mathematical Society, 1999.

15) [ Google Scholar citations: 97 ]  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.

16)  [ Google Scholar citations: 95 ]  S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro, Local search with perturbations for the prize-collecting Steiner tree problem in graphs, Networks, vol. 38, pp. 50-58, 2001.

17)  [ Google Scholar citations: 86 ]  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.

18) [ Google Scholar citations: 84 ]  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. 

19) [ Google Scholar citations: 83 ]   R.A. Murphey, P.M. Pardalos, and M.G.C. Resende, Frequency assignment problems, in "Handbook of Combinatorial Optimization"",  D.-Z. Du and P.M. Pardalos, Eds., Kluwer Academic Publishers, Supplement vol. A, pp. 295-377, 2000.

20) [ Google Scholar citations: 83 ]   M.G.C. Resende and C.C. Ribeiro, GRASP with path-relinking: Recent advances and applications, in  "Metaheuristics: Progress as Real Problem Solvers,"  T. Ibaraki, K. Nonobe and M. Yagiura, (Eds.), Springer, pp. 29-63, 2005.

21)  [ Google Scholar citations:  82 ]  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.


22)  [ Google Scholar citations: 81 ]  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. 

23) [ Google Scholar citations: 81 ] 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.

24)  [ Google Scholar citations: 75 ]  L. S. Pitsoulis and M. G. C. Resende, Greedy randomized adaptive search procedures, Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende, Eds., Oxford University Press, pp. 168-183, 2002.

25) [ Google Scholar citations: 74 ]  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

26) [ Google Scholar citations: 68 ]  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.

27)  [ Google Scholar citations: 68 ]   P. Festa, P.M. Pardalos, and M.G.C. Resende, Feedback set problems, Handbook of Combinatorial Optimization, D.-Z. Du and P.M. Pardalos, Eds., Kluwer Academic Publishers, Supplement vol. A, pp. 209-259, 2000.

28)  [ Google Scholar citations: 66 ]   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. 

29) [ Google Scholar citations: 65 ]  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.

30) [ Google Scholar citations: 65 ]  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.

31) [ Google Scholar citations: 65 ]  M.G.C. Resende and T.A. Feo, A GRASP for Satisfiability, in "Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge", David S. Johnson and Michael A. Trick, Eds., DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 499-520, American Mathematical Society, 1996.

32) [ Google Scholar citations: 63 ]   L.S. Buriol, M.G.C. Resende, Celso C. Ribeiro, and M. Thorup, A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing, Networks, vol. 46, no. 1, pp. 36-56, 2005.

33)  [ Google Scholar citations: 63 ]  M.G.C. Resende and C.C. Ribeiro, A GRASP for graph planarization, Networks, vol. 29, pp. 173-189, 1997.

34)  [ Google Scholar citations: 63 ]  S.L. Martins, M.G.C. Resende, C.C. Ribeiro, and P.M. Pardalos, A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy, J. of Global Optimization, vol. 17, pp. 267-283, 2000.

35)  [ Google Scholar citations: 58 ]  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.

36)   [ Google Scholar citations: 57 ]  J. Abello, M.G.C. Resende and S. Sudarsky, Massive quasi-clique detection,  LATIN 2002: Theoretical Informatics, S. Rajsbaum (Ed.), Lecture Notes in Computer Science, vol. 2286, pp. 598-612, Springer Verlag, 2002.

37)   [ Google Scholar citations: 57 ]  P. Festa, P.M. Pardalos, M.G.C. Resende, and  C.C. Ribeiro,  Randomized heuristics for the MAX-CUT problem, Optimization Methods and Software, vol. 7, pp. 1033-1058, 2002.

38)  [ Google Scholar citations: 55 ]  J. Abello, P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Massive Data Sets, Kluwer Academic Publishers, May 2002 .

39) [ Google Scholar citations: 54 ]   M.G.C. Resende and G. Veiga, An efficient implementation of a network interior point method, Network Flows and Matching: First DIMACS Implementation Challenge, D.S. Johnson and C.C. McGeoch, eds., DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 12, pp. 299-348, 1993.

40)  [ Google Scholar citations: 54 ]   M.G.C. Resende and G. Veiga, An implementation of the dual affine scaling algorithm for minimum cost flow on a bipartite network, SIAM J. on Optimization, vol. 3, pp. 516-537, 1993.

41) [ Google Scholar citations: 53 ]  M.G.C. Resende, P.M. Pardalos, and Y. Li,  Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment poblems using GRASP, ACM Transactions on Mathematical Software, vol. 22, pp. 104-118, 1996. 

42)  [ Google Scholar citations: 51 ]  P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende, A parallel GRASP implementation for the Quadratic Assignment Problem, Parallel Algorithms for Irregular Problems, A. Ferreira and J. Rolim, eds, Kluwer Academic Publishers, pages 111-130, 1995.

43)  [ Google Scholar citations: 51 ]  M.G.C. Resende, Computing approximate solutions of the maximum covering problem using GRASP, J. of Heuristics, vol. 4, pp. 161-171, 1998.

44) [ Google Scholar citations: 48 ]  T. Mavridou, P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende, Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP, Parallel Algorithms for Irregularly Structured Problems, Proceedings of the Second International Workshop - Irregular'95, A. Ferreira and J. Rolim, eds., Lecture Notes in Computer Science, Springer-Verlag, vol. 980, pp. 317-331, 1995.


45)  [ Google Scholar citations: 47 ]   L.F. Portugal, M.G.C. Resende, G. Veiga, and J.J. Júdice, A truncated primal-infeasible dual-feasible network interior point method, Networks, vol. 35, pp. 91--108, 2000.

46) [ Google Scholar citations: 46 ]   L.S. Buriol, M.G.C. Resende, Celso C. Ribeiro, and M. Thorup, A memetic algorithm for OSPF routing, Proceedings of the 6th INFORMS Telecommunications Conference, 2002.

47)  [ Google Scholar citations: 38 ]  M.G.C. Resende and R.F. Werneck, A fast swap-based local search procedure for location problems, Annals of Operations Research, vol. 150, pp. 205-230, 2007.

48)  [ Google Scholar citations: 35 ]   L S. Pitsoulis, P.M. Pardalos, and M.G.C. Resende, A Parallel GRASP for MAX-SAT, Lecture Notes in Computer Science, vol. 1180, pp. 575-585, 1996.

49)  [ Google Scholar citations: 34 ]  J.E. Mitchell, P.M. Pardalos, and M.G.C. Resende, Interior point methods for combinatorial optimization, in Handbook of Combinatorial Optimization, D.-Z. Du, P.M. Pardalos, eds., vol. 1, pp. 189-298, Kluwer Academic Publishers, 1998.

50)  [ Google Scholar citations: 34 ]  P.M. Pardalos, T. Qian, and M.G.C. Resende, A GRASP for Feedback Vertex Set, J. of Combinatorial Optimization, vol. 2, pp. 399-412, 1999.

51)  [ Google Scholar citations: 33 ]  M.G.C. Resende and P.M. Pardalos, Eds., Handbook of Optimization in Telecommunication, Springer Science + Business Media, 2006.

52)  [ Google Scholar citations: 33 ]   M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos, Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP, Discrete Applied Mathematics, vol. 100, pp. 95-113, 2000.