The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mauricio G. C. Resende: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mauricio G. C. Resende, Renato Fonseca F. Werneck
    On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2003, pp:119-127 [Conf]
  2. Fernando de Carvalho Gomes, Panos M. Pardalos, Carlos A. S. Oliveira, Mauricio G. C. Resende
    Reactive GRASP with path relinking for channel assignment in mobile phone networks. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2001, pp:60-67 [Conf]
  3. Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende
    Computational Experience with an Interior Point Algorithm on the Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:333-349 [Conf]
  4. Renata M. Aiex, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
    A GRASP for Computing Approximate Solutions for the Three-Index Assignment Problem. [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:504- [Conf]
  5. Panos M. Pardalos, Leonidas S. Pitsoulis, T. Mavridou, Mauricio G. C. Resende
    Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1995, pp:317-331 [Conf]
  6. James Abello, Mauricio G. C. Resende, Sandra Sudarsky
    Massive Quasi-Clique Detection. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:598-612 [Conf]
  7. Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
    A Parallel GRASP for MAX-SAT Problems. [Citation Graph (0, 0)][DBLP]
    PARA, 1996, pp:575-585 [Conf]
  8. Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
    GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:367-379 [Conf]
  9. Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio G. C. Resende
    GRASP with Path-Relinking for the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:356-368 [Conf]
  10. Mauricio G. C. Resende, José Luis González Velarde
    GRASP: Procedimientos de búsquedas miopes aleatorizados y adaptativos. [Citation Graph (0, 0)][DBLP]
    Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial, 2003, v:19, n:, pp:61-76 [Journal]
  11. Abilio Lucena, Mauricio G. C. Resende
    Strong lower bounds for the prize collecting Steiner problem in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:277-294 [Journal]
  12. Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos
    Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:1-2, pp:95-113 [Journal]
  13. Renata M. Aiex, Mauricio G. C. Resende, Celso C. Ribeiro
    Probability Distribution of Solution Time in GRASP: An Experimental Investigation. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2002, v:8, n:3, pp:343-373 [Journal]
  14. Mauricio G. C. Resende
    Computing Approximate Solutions of the Maximum Covering Problem with GRASP. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 1998, v:4, n:2, pp:161-177 [Journal]
  15. Mauricio G. C. Resende, Renato Fonseca F. Werneck
    A Hybrid Heuristic for the p-Median Problem. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2004, v:10, n:1, pp:59-88 [Journal]
  16. Renata M. Aiex, Mauricio G. C. Resende, Panos M. Pardalos, Gerardo Toraldo
    GRASP with Path Relinking for Three-Index Assignment. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2005, v:17, n:2, pp:224-247 [Journal]
  17. M. Ericsson, Mauricio G. C. Resende, Panos M. Pardalos
    A Genetic Algorithm for the Weight Setting Problem in OSPF Routing. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2002, v:6, n:3, pp:299-333 [Journal]
  18. Panos M. Pardalos, Tianbing Qian, Mauricio G. C. Resende
    A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:399-412 [Journal]
  19. Mauricio G. C. Resende
    "Mobile Networks and Computing". [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:4, pp:297-298 [Journal]
  20. Mauricio G. C. Resende
    Multichannel Optical Networks: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:4, pp:495-496 [Journal]
  21. Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
    GRASP with path relinking for the weighted MAXSAT problem. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
  22. Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende
    A continuous approach to inductive inference. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:57, n:, pp:215-238 [Journal]
  23. Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan
    An interior point algorithm to solve computationally difficult set covering problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:597-618 [Journal]
  24. S. A. Canuto, Mauricio G. C. Resende, Celso C. Ribeiro
    Local search with perturbations for the prize-collecting Steiner tree problem in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:1, pp:50-58 [Journal]
  25. Luis F. Portugal, Mauricio G. C. Resende, Geraldo Veiga, Joaquim Júdice
    A truncated primal-infeasible dual-feasible network interior point method. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:2, pp:91-108 [Journal]
  26. Mauricio G. C. Resende, Celso C. Ribeiro
    A GRASP with path-relinking for private virtual circuit routing. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:2, pp:104-114 [Journal]
  27. Mauricio G. C. Resende, Celso C. Ribeiro
    A GRASP for graph planarization. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:3, pp:173-189 [Journal]
  28. Mauricio G. C. Resende, Geraldo Veiga
    An annotated bibliography of network interior point methods. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:2, pp:114-121 [Journal]
  29. Luciana S. Buriol, Mauricio G. C. Resende, Celso C. Ribeiro, Mikkel Thorup
    A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:46, n:1, pp:36-56 [Journal]
  30. Renata M. Aiex, S. Binato, Mauricio G. C. Resende
    Parallel GRASP with path-relinking for job shop scheduling. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2003, v:29, n:4, pp:393-430 [Journal]
  31. Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende
    Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 2001, v:27, n:4, pp:456-464 [Journal]
  32. Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
    Algorithm 769: Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems Using GRASP. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1997, v:23, n:2, pp:196-208 [Journal]
  33. Mauricio G. C. Resende, Thomas A. Feo, Stuart H. Smith
    Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1998, v:24, n:4, pp:386-394 [Journal]
  34. Mauricio G. C. Resende, Panos M. Pardalos, Yong Li
    Algorithm 754: Fortran Subroutines for Approximate Solution of Dense Quadratic Assignment Problems Using GRASP. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1996, v:22, n:1, pp:104-118 [Journal]
  35. Celso C. Ribeiro, Mauricio G. C. Resende
    Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Math. Softw., 1999, v:25, n:3, pp:341-352 [Journal]
  36. Mauricio G. C. Resende, Renato Fonseca F. Werneck
    A hybrid multistart heuristic for the uncapacitated facility location problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:174, n:1, pp:54-68 [Journal]
  37. José Fernando Gonçalves, Jorge José de Magalhães Mendes, Mauricio G. C. Resende
    A hybrid genetic algorithm for the job shop scheduling problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:167, n:1, pp:77-95 [Journal]
  38. Renata Teixeira, Timothy G. Griffin, Mauricio G. C. Resende, Jennifer Rexford
    TIE breaking: tunable interdomain egress selection. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2007, v:15, n:4, pp:761-774 [Journal]

  39. Fast Local Search for the Maximum Independent Set Problem. [Citation Graph (, )][DBLP]


  40. Efficient Implementations of Heuristics for Routing and Wavelength Assignment. [Citation Graph (, )][DBLP]


  41. Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm. [Citation Graph (, )][DBLP]


  42. TIE breaking: tunable interdomain egress selection. [Citation Graph (, )][DBLP]


  43. A random key based genetic algorithm for the resource constrained project scheduling problem. [Citation Graph (, )][DBLP]


  44. GRASP and path relinking for the max-min diversity problem. [Citation Graph (, )][DBLP]


  45. A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002