| 2009 |
|---|
| 52 | EE | Paola Festa,
Panos M. Pardalos,
Mauricio G. C. Resende:
Feedback Set Problems.
Encyclopedia of Optimization 2009: 1005-1016 |
| 51 | EE | Mauricio G. C. Resende,
Celso C. Ribeiro:
Graph Planarization.
Encyclopedia of Optimization 2009: 1448-1453 |
| 50 | EE | Mauricio G. C. Resende:
Greedy Randomized Adaptive Search Procedures.
Encyclopedia of Optimization 2009: 1460-1469 |
| 49 | EE | Jorge José de Magalhães Mendes,
José Fernando Gonçalves,
Mauricio G. C. Resende:
A random key based genetic algorithm for the resource constrained project scheduling problem.
Computers & OR 36(1): 92-109 (2009) |
| 2008 |
|---|
| 48 | EE | Thiago F. Noronha,
Mauricio G. C. Resende,
Celso C. Ribeiro:
Efficient Implementations of Heuristics for Routing and Wavelength Assignment.
WEA 2008: 169-180 |
| 47 | EE | Diogo Viera Andrade,
Mauricio G. C. Resende,
Renato Fonseca F. Werneck:
Fast Local Search for the Maximum Independent Set Problem.
WEA 2008: 220-234 |
| 46 | EE | José Fernando Gonçalves,
Jorge José de Magalhães Mendes,
Mauricio G. C. Resende:
A genetic algorithm for the resource constrained multi-project scheduling problem.
European Journal of Operational Research 189(3): 1171-1190 (2008) |
| 45 | EE | Luciana S. Buriol,
Mauricio G. C. Resende,
Mikkel Thorup:
Speeding Up Dynamic Shortest-Path Algorithms.
INFORMS Journal on Computing 20(2): 191-204 (2008) |
| 2007 |
|---|
| 44 | EE | Mauricio G. C. Resende,
Renato Fonseca F. Werneck:
A fast swap-based local search procedure for location problems.
Annals OR 150(1): 205-230 (2007) |
| 43 | EE | Renata Teixeira,
Timothy G. Griffin,
Mauricio G. C. Resende,
Jennifer Rexford:
TIE breaking: tunable interdomain egress selection.
IEEE/ACM Trans. Netw. 15(4): 761-774 (2007) |
| 42 | EE | Luciana S. Buriol,
Mauricio G. C. Resende,
Mikkel Thorup:
Survivable IP network design with OSPF routing.
Networks 49(1): 51-64 (2007) |
| 41 | EE | M. J. Hirsch,
Cláudio Nogueira de Meneses,
Panos M. Pardalos,
Mauricio G. C. Resende:
Global optimization by continuous grasp.
Optimization Letters 1(2): 201-212 (2007) |
| 40 | EE | Renata M. Aiex,
Mauricio G. C. Resende,
Celso C. Ribeiro:
TTT plots: a perl program to create time-to-target plots.
Optimization Letters 1(4): 355-366 (2007) |
| 2006 |
|---|
| 39 | EE | Paola Festa,
Panos M. Pardalos,
Leonidas S. Pitsoulis,
Mauricio G. C. Resende:
GRASP with path relinking for the weighted MAXSAT problem.
ACM Journal of Experimental Algorithmics 11: (2006) |
| 38 | EE | Mauricio G. C. Resende,
Renato Fonseca F. Werneck:
A hybrid multistart heuristic for the uncapacitated facility location problem.
European Journal of Operational Research 174(1): 54-68 (2006) |
| 2005 |
|---|
| 37 | EE | Renata Teixeira,
Timothy G. Griffin,
Mauricio G. C. Resende,
Jennifer Rexford:
TIE breaking: tunable interdomain egress selection.
CoNEXT 2005: 93-104 |
| 36 | EE | Paola Festa,
Panos M. Pardalos,
Leonidas S. Pitsoulis,
Mauricio G. C. Resende:
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem.
WEA 2005: 367-379 |
| 35 | EE | José Fernando Gonçalves,
Jorge José de Magalhães Mendes,
Mauricio G. C. Resende:
A hybrid genetic algorithm for the job shop scheduling problem.
European Journal of Operational Research 167(1): 77-95 (2005) |
| 34 | EE | Renata M. Aiex,
Mauricio G. C. Resende,
Panos M. Pardalos,
Gerardo Toraldo:
GRASP with Path Relinking for Three-Index Assignment.
INFORMS Journal on Computing 17(2): 224-247 (2005) |
| 33 | EE | 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.
Networks 46(1): 36-56 (2005) |
| 2004 |
|---|
| 32 | EE | Carlos A. S. Oliveira,
Panos M. Pardalos,
Mauricio G. C. Resende:
GRASP with Path-Relinking for the Quadratic Assignment Problem.
WEA 2004: 356-368 |
| 31 | EE | Abilio Lucena,
Mauricio G. C. Resende:
Strong lower bounds for the prize collecting Steiner problem in graphs.
Discrete Applied Mathematics 141(1-3): 277-294 (2004) |
| 30 | EE | Mauricio G. C. Resende,
Renato Fonseca F. Werneck:
A Hybrid Heuristic for the p-Median Problem.
J. Heuristics 10(1): 59-88 (2004) |
| 2003 |
|---|
| 29 | | Mauricio G. C. Resende,
Renato Fonseca F. Werneck:
On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem.
ALENEX 2003: 119-127 |
| 28 | EE | Mauricio G. C. Resende,
José Luis González Velarde:
GRASP: Procedimientos de búsquedas miopes aleatorizados y adaptativos.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 19: 61-76 (2003) |
| 27 | EE | Mauricio G. C. Resende,
Celso C. Ribeiro:
A GRASP with path-relinking for private virtual circuit routing.
Networks 41(2): 104-114 (2003) |
| 26 | EE | Mauricio G. C. Resende,
Geraldo Veiga:
An annotated bibliography of network interior point methods.
Networks 42(2): 114-121 (2003) |
| 25 | EE | Renata M. Aiex,
S. Binato,
Mauricio G. C. Resende:
Parallel GRASP with path-relinking for job shop scheduling.
Parallel Computing 29(4): 393-430 (2003) |
| 2002 |
|---|
| 24 | EE | James Abello,
Mauricio G. C. Resende,
Sandra Sudarsky:
Massive Quasi-Clique Detection.
LATIN 2002: 598-612 |
| 23 | | M. Ericsson,
Mauricio G. C. Resende,
Panos M. Pardalos:
A Genetic Algorithm for the Weight Setting Problem in OSPF Routing.
J. Comb. Optim. 6(3): 299-333 (2002) |
| 22 | | Renata M. Aiex,
Mauricio G. C. Resende,
Celso C. Ribeiro:
Probability Distribution of Solution Time in GRASP: An Experimental Investigation.
J. Heuristics 8(3): 343-373 (2002) |
| 2001 |
|---|
| 21 | EE | 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.
DIAL-M 2001: 60-67 |
| 20 | EE | Paola Festa,
Panos M. Pardalos,
Mauricio G. C. Resende:
Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP.
ACM Trans. Math. Softw. 27(4): 456-464 (2001) |
| 19 | EE | Abilio Lucena,
Mauricio G. C. Resende:
Generating lower bounds for the prize collecting Steiner problem in graphs.
Electronic Notes in Discrete Mathematics 7: 70-73 (2001) |
| 18 | | Mauricio G. C. Resende:
"Mobile Networks and Computing".
J. Comb. Optim. 5(4): 297-298 (2001) |
| 17 | | Mauricio G. C. Resende:
Multichannel Optical Networks: Theory and Practice.
J. Comb. Optim. 5(4): 495-496 (2001) |
| 16 | EE | S. A. Canuto,
Mauricio G. C. Resende,
Celso C. Ribeiro:
Local search with perturbations for the prize-collecting Steiner tree problem in graphs.
Networks 38(1): 50-58 (2001) |
| 2000 |
|---|
| 15 | EE | 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.
IPDPS Workshops 2000: 504 |
| 14 | | Mauricio G. C. Resende,
Leonidas S. Pitsoulis,
Panos M. Pardalos:
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP.
Discrete Applied Mathematics 100(1-2): 95-113 (2000) |
| 13 | EE | Luis F. Portugal,
Mauricio G. C. Resende,
Geraldo Veiga,
Joaquim Júdice:
A truncated primal-infeasible dual-feasible network interior point method.
Networks 35(2): 91-108 (2000) |
| 1999 |
|---|
| 12 | EE | Celso C. Ribeiro,
Mauricio G. C. Resende:
Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP.
ACM Trans. Math. Softw. 25(3): 341-352 (1999) |
| 1998 |
|---|
| 11 | EE | Mauricio G. C. Resende,
Thomas A. Feo,
Stuart H. Smith:
Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP.
ACM Trans. Math. Softw. 24(4): 386-394 (1998) |
| 10 | | Panos M. Pardalos,
Tianbing Qian,
Mauricio G. C. Resende:
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem.
J. Comb. Optim. 2(4): 399-412 (1998) |
| 9 | | Mauricio G. C. Resende:
Computing Approximate Solutions of the Maximum Covering Problem with GRASP.
J. Heuristics 4(2): 161-177 (1998) |
| 1997 |
|---|
| 8 | EE | Panos M. Pardalos,
Leonidas S. Pitsoulis,
Mauricio G. C. Resende:
Algorithm 769: Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems Using GRASP.
ACM Trans. Math. Softw. 23(2): 196-208 (1997) |
| 7 | EE | Mauricio G. C. Resende,
Celso C. Ribeiro:
A GRASP for graph planarization.
Networks 29(3): 173-189 (1997) |
| 1996 |
|---|
| 6 | | Panos M. Pardalos,
Leonidas S. Pitsoulis,
Mauricio G. C. Resende:
A Parallel GRASP for MAX-SAT Problems.
PARA 1996: 575-585 |
| 5 | EE | Mauricio G. C. Resende,
Panos M. Pardalos,
Yong Li:
Algorithm 754: Fortran Subroutines for Approximate Solution of Dense Quadratic Assignment Problems Using GRASP.
ACM Trans. Math. Softw. 22(1): 104-118 (1996) |
| 1995 |
|---|
| 4 | | Panos M. Pardalos,
Leonidas S. Pitsoulis,
Thelma D. Mavridou,
Mauricio G. C. Resende:
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP.
IRREGULAR 1995: 317-331 |
| 1992 |
|---|
| 3 | | Anil P. Kamath,
Narendra Karmarkar,
K. G. Ramakrishnan,
Mauricio G. C. Resende:
A continuous approach to inductive inference.
Math. Program. 57: 215-238 (1992) |
| 1991 |
|---|
| 2 | | Narendra Karmarkar,
Mauricio G. C. Resende,
K. G. Ramakrishnan:
An interior point algorithm to solve computationally difficult set covering problems.
Math. Program. 52: 597-618 (1991) |
| 1990 |
|---|
| 1 | | Anil P. Kamath,
Narendra Karmarkar,
K. G. Ramakrishnan,
Mauricio G. C. Resende:
Computational Experience with an Interior Point Algorithm on the Satisfiability Problem.
IPCO 1990: 333-349 |
