## Publications of Mauricio G. C. Resende | ||||

> | ||||

updated:18 July 2019 | ||||

SPSPSP | ||||

## Accepted | ||||

SPSPSP | ||||

## 2019 | ||||

SPSPSP | ||||

Authors: | D.S. Johnson, L.Breslau, I. Diakonikolas, N. Duffield, Y. Gu, M. Hajiaghayi, H. Karloff, M.G.C. Resende, and S. Sen | |||

Title: | Near-optimal
disjoint-path facility location through set cover by pairs | |||

Source: | Technical report, arXiv:1611.0121, November 3, 2016. Accepted July 17, 2019. To appear in Operations Research. | |||

Links: | [ abstract | PDF | arXiv ] | |||

SPSPSP | ||||

## Published | ||||

SPACE | ||||

## 2019 | ||||

SPACE | ||||

Authors: | Fernando Stefanello, Vaneet Aggarwal, Luciana S. Buriol, and Mauricio G. C. Resende | |||

Title: | Hybrid algorithms for placement of virtual machines across geo-separated data centers | |||

Source: | J. of Combinatorial Optimization, published online 10 May 2019 | |||

Link: | [ PDF | DOI ] | |||

SPACE | ||||

Authors: | M.G.C. Resende and C.C. Ribeiro | |||

Title: | Greedy randomized adaptive search procedures: Advances and extensions | |||

Source: | Handbook of Metaheuristics, 3rd edition, M. Gendreau and J.-Y. Potvin, Eds., Springer, pp. 169-220, 2019 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

2018 | ||||

SPACE | ||||

Editors: | R. Martí, P.M. Pardalos and M.G.C. Resende | |||

Title: | Handbook of Heuristics | |||

Source: | Springer International Publishing, 2018 | |||

Link: | [ DOI ] | |||

SPACE | ||||

Authors: | J.F. Gonçalves and M.G.C. Resende | |||

Title: | Random-key genetic algorithms | |||

Source: | Handbook of Heuristics, R. Martí, P.M. Pardalos, and M.G.C. Resende, eds., pp. 703-715, Springer, 2018 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | P. Festa and M.G.C. Resende | |||

Title: | GRASP | |||

Source: | Handbook of Heuristics, R. Martí, P.M. Pardalos, and M.G.C. Resende, eds., pp. 465-488, Springer, 2018 | |||

Links: | [ PDF | DOI ] | |||

SPACE | ||||

Authors: | J.F. Gonçalves and M.G.C. Resende | |||

Title: | Biased random-key genetic programming | |||

Source: | Handbook of Heuristics, R. Martí, P.M. Pardalos, and M.G.C. Resende, eds., vol. 1, pp. 23-37, Springer, 2018 | |||

Links: | [ PDF | DOI ] | |||

SPACE | ||||

2017 | ||||

SPACE | ||||

Authors: | D. Ferone, P Festa, A. Napoletano, and M.G.C. Resende | |||

Title: | A new local search for the p-center problem based on the critical vertex concept | |||

Source: | In Battiti R., Kvasov D., Sergeyev Y. (eds) Learning and Intelligent Optimization. LION 2017. Lecture Notes in Computer Science, vol 10556. Springer, Cham. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | J.S. Brandão, T.F. Noronha, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems | |||

Source: | International
Transactions in Operational Research, vol. 24, pp. 1061-1077, 2017 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | F. Stefanello, L.S. Buriol, M.J. Hirsch, P.M. Pardalos, T. Querido, M.G.C. Resende, and M. Ritt | |||

Title: | On the minimization of traffic congestion in road networks with tolls | |||

Source: | Annals of Operations Research, vol. 249, pp. 119-139, 2017 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | H. de Faria Jr., M.G.C. Resende, and D. Ernst | |||

Title: | A biased random-key genetic algorithm applied to the electric distribution network reconfiguration problem | |||

Source: | J. of Heuristics, vol. 23, pp. 533-550, 2017 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | L.S. Pessoa, A.C. Santos, and M.G.C. Resende | |||

Title: | A biased random-key genetic algorithm for the tree of hubs location problem | |||

Source: | Optimization Letters, vol. 11, pp. 1371-1384, 2017 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

2016 | ||||

SPACE | ||||

Authors: | Mauricio G. C. Resende and Celso C. Ribeiro | |||

Title: | Optimization by GRASP: Greedy randomized adaptive search procedures | |||

Source: | Springer, New York, 2016 | |||

Links: | [ Preface PDF | DOI ] | |||

SPACE | ||||

Authors: | M.C. Lopes, C.E. de Andrade, T.A. de Queiroz, M.G.C. Resende, and F.K. Miyazawa | |||

Title: | Heuristics
for a hub location-routing problem | |||

Source: | Networks, vol. 68, pp. 54-90, 2016 | |||

Links: | [ DOI ] | |||

SPSPSP | ||||

Authors: | R.B. Damm, M.G.C. Resende, and D.P. Ronconi | |||

Title: | A biased random key genetic algorithm for the field technician scheduling problem | |||

Source: | Computers & Operations Research, vol. 75, pp. 49-63, 2016 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | A.A. Chaves, L.A.N. Lorena, E.L.F. Senne, and M.G.C. Resende | |||

Title: | Hybrid
method with CS and BRKGA applied to the minimization of tool switches problem | |||

Source: | Computers & Operations Research, vol. 67, pp. 174-183, 2016 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | José Fernando Gonçalves, Mauricio G. C. Resende, and Miguel Dias Costa | |||

Title: | A biased random-key genetic algorithm for the minimization of open stacks problem | |||

Source: | International
Transactions in Operational Research, vol. 23, pp. 25-46, 2016 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | D. Ferone, P. Festa, and M.G.C. Resende | |||

Title: | Hybridizations of GRASP with path-relinking for the far from most string problem | |||

Source: | International
Transactions in Operational Research, vol. 23, pp. 481-506, 2016 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

2015 | ||||

SPSPSP | ||||

Authors: | J.S. Brandão, T.F. Noronha, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | A biased random-key genetic algorithm for single-round divisible load scheduling | |||

Source: | International Transactions in Operational Research, vol. 22, pp. 823-839, 2015 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | C.E. de Andrade, R.F. Toso, M.G.C. Resende, and F.K. Miyazawa | |||

Title: | Biased random-key genetic algorithms for the winner determination problem in combinatorial auctions | |||

Source: | Evolutionary
Computation, vol. 23, pp. 279-307, 2015 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | J.F. Gonçalves and M.G.C. Resende | |||

Title: | A biased random-key genetic algorithm for the unequal area facility layout problem | |||

Source: | European J. of Operational Research, vol. 246, pp. 86-107, 2015 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | F. Stefanello, V. Aggarwal, L.S. Buriol, J.F. Gonçalves, and M.G.C. Resende | |||

Title: | A biased random-key genetic algorithm for placement of virtual machines across geo-separated data centers | |||

Source: | Proceedings of the 2015 Genetic and Evolutionary Computation Conference (GECCO'15), Madrid, July 11-15, 2015, pp. 919-926, 2015 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | C.E. Andrade, M.G.C. Resende, W. Zhang, R.K. Sinha, K.C. Reichmann, R.D. Doverspike, and F.K. Miyazawa | |||

Title: | A biased random-key genetic algorithm for wireless backhaul network design | |||

Source: | Applied Soft Computing, vol. 33, pp. 150-169, 2015 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | A. Duarte, J. Sánchez-Oro, M.G.C. Resende, F. Glover, and R. Martí | |||

Title: | Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization | |||

Source: | Information Systems, vol. 296, pp. 40-60, 2015 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | E. Ruiz, M. Albareda-Sambola, E. Fernández, and M.G.C. Resende | |||

Title: | A biased random-key genetic algorithm for the capacitated minimum spanning tree problem | |||

Source: | Computers and Operations Research, vol. 57, pp. 95-108, 2015 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | R.F. Toso and M.G.C. Resende | |||

Title: | A C++ application programming interface for biased random-key genetic algorithms | |||

Source: | Optimization
Methods and Software, vol. 30, pp. 81-93, 2015 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | R. Martí, V. Campos, M.G.C. Resende, and A. Duarte | |||

Title: | Multi-objective GRASP with path-relinking | |||

Source: | European J. of Operational Research, vol. 240, pp. 54-71, 2015 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | R.M.A. Silva, M.G.C. Resende, and P.M. Pardalos | |||

Title: | A Python/C++ library for bound-constrained global optimization using biased random-key genetic algorithm | |||

Source: | J. of Combinatorial Optimization, vol. 30, pp. 710-728, 2015 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

2014 | ||||

SPSPSP | ||||

Authors: | J.F.
Gonçalves, J.J.M. Mendes, and M.G.C. Resende | |||

Title: | The
basic multi-project scheduling project problem | |||

Source: | Handbook on Project Management and Scheduling, vol. 2, chapter 31, pp. 667-683, International Handbooks on Information Systems, C. Schwindt and J. Zimmermann (Eds.), Springer, 2014 | |||

Links: | [ abstract | DOI ] | |||

SPSPSP | ||||

Authors: | R.M.A. Silva, M.G.C. Resende, and P.M. Pardalos | |||

Title: | Finding multiple roots of box-constrained system of nonlinear equations with a biased random-key genetic algorithm | |||

Source: | J. of Global Optimization, vol. 60, pp. 289-306, 2014 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPSPSP | ||||

Authors: | M.L. Lucena, C.E. Andrade, M.G.C. Resende, and F.K. Miyazawa | |||

Title: | Some
extensions of biased random-key genetic algorithms | |||

Source: | Proceedings of the XLVI Symposium of the Brazilian Operational Research Society, Salvador, Brazil, September 16-19, 2014 | |||

Links: | [ abstract | PDF ] | |||

SPSPSP | ||||

Editors: | P.M. Pardalos,, M.G.C. Resende, C. Vogiatzis, and J.L. Walteros | |||

Title: | Learning and Intelligent Optimization, 8th International Conference (LION 8) | |||

Source: | Lecture Notes in Computer Science, vol. 8426, 2014 | |||

Links: | [ Preface | DOI ] | |||

SPSPSP | ||||

Authors: | J.F. Gonçalves, M.G.C. Resende, and R.F. Toso | |||

Title: | An experimental comparison of biased and unbiased random-key genetic algorithms | |||

Source: | Pesquisa Operacional, vol. 34, pp. 143-164, 2014 | |||

Links: |
| |||

SPSPSP | ||||

Authors: | C.E. Andrade, M.G.C. Resende, H.J. Karloff, and F.K. Miyazawa | |||

Title: | Evolutionary algorithms for overlapping correlation clustering | |||

Source: | Proceedings of Genetic and Evolutionary Computation Conference (GECCO'14), pp. 405-412, Vancouver, Canada, July 12-16, 2014 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | A. Duarte, R. Martí, M.G.C. Resende, and R.M.A. Silva | |||

Title: | Improved heuristics for the regenerator location problem | |||

Source: | International
Transactions in Operational Research, vol. 21, pp. 541-558, 2014 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | R.M.A. Silva, D.M. Silva, M.G.C. Resende, G.R. Mateus, J.F. Gonçalves, and P. Festa | |||

Title: | An edge-swap heuristic for generating spanning trees with minimum number of branch vertices | |||

Source: | Optimization Letters, vol. 8, pp. 1225-1243, 2014 | |||

Links: | [ abstract | PDF | DOI ] | |||

Authors: | J.F. Gonçalves and M.G.C. Resende | |||

Title: | An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling | |||

Source: | International Transactions in Operational Research, vol. 21, pp. 215-246, 2014 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | A.
Grasas, H.R. Lourenço, L.S. Pessoa, M.G.C.
Resende, I. Caballé, and
N. Barba | |||

Title: | On the improvement of blood sample collection at clinical laboratories | |||

Source: | BMC Health Services Research, vol. 14, article 12, 2014 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | L.F. Morán-Mirabal, J.L. González-Velarde, and M.G.C. Resende | |||

Title: | Randomized heuristics for the family traveling salesperson problem | |||

Source: | International
Transactions in Operational Research, vol. 21, pp. 41-57, 2014 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | M.G.C. Resende and C.C. Ribeiro | |||

Title: | GRASP: Greedy Randomized Adaptive Search Procedures | |||

Source: | Search Methodologies, 2nd edition, E.K. Burke and G. Kendall (Eds.), Chapter 11, pp. 287-310, Springer, 2014. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACamposhttp://dx.doi.org/10.1016/j.ejor.2014.06.042CE | ||||

2013 | ||||

SPACE | ||||

Authors: | L.S. Pessoa, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | A hybrid Lagrangean heuristic with GRASP and path relinking for set k-covering | |||

Source: | Computers and Operations Research, vol. 40, pp. 3132-3146, 2013 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | C. Ranaweera, M.G.C. Resende, K.C. Reichmann, P.P. Iannone, P.S. Henry, B-J. Kim, P.D. Magill, K.N. Oikonomou, R.K. Sinha, and S.L. Woodward | |||

Title: | Design and optimization of fiber-optic small-cell backhaul based on an existing fiber-to-the-node residential access network | |||

Source: | IEEE Communications Magazine, vol. 51(9), pp. 62-69, 2013 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Author: | R.M.A. Silva, M.G.C. Resende, P.M. Pardalos, G.R. Mateus, and G. de Tomi | |||

Title: | GRASP
with path-relinking for facility layout | |||

Source: | in Models,
Algorithms, and Technologies for Network Analysis, B.I. Goldengorin, V.A. Kalyagin, and P.M. Pardalos (Eds.), Springer Proceedings in Mathematics & Statistics, volume 59, 175-190, Springer,
2013 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | J.F. Gonçalves, M.G.C. Resende, and R.F. Toso | |||

Title: | Biased and unbiased random key genetic algorithms: An experimental analysis | |||

Source: | Proceedings of the 10th Metaheuristics International Conference (MIC 2013), Singapore, 2013 | |||

Links: | [ abstract | PDF ] | |||

SPACE | ||||

Authors: | R.M.A. Silva, M.G.C. Resende, P.M. Pardalos, and J.L.D. Facó | |||

Title: | Biased
random-key genetic algorithm for non-linearly constrained global optimization | |||

Source: | Proceedings
of the 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 2201-2206, Cancun, June 20-23, 2013 | |||

Links: | [ abstract | PDF ] DOI ] | |||

SPACE | ||||

Authors: | Carlos E. de Andrade, Flávio K. Miyazawa, and Maurcio G.C. Resende | |||

Title: | Evolutionary algorithm for the k-interconnected multi-depot mutlti-traveling salesmen problem | |||

Source: | Proceedings of the Fifteenth Annual Conference on Genetic and Evolutionary Computation (GECCO'13), pp. 463-470, ACM, New York, 2013. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | L.F. Morán-Mirabal, J.L. González-Velarde, M.G.C. Resende, and R.M.A. Silva | |||

Title: | Randomized heuristics for handover minimization in mobility networks | |||

Source: | J. of Heuristics, vol. 19, pp. 845-880, 2013 | |||

Links: | [ abstract | PDF | DOI ] | |||

Authors: | R.M.A. Silva, M.G.C. Resende, P.M. Pardalos, and M.J. Hirsch | |||

Title: | A Python/C library for bound-constrained global optimization with continuous GRASP | |||

Source: | Optimization Letters, vol. 7, pp. 967-984, 2013 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | D. Ferone, P. Festa, and M.G.C. Resende | |||

Title: | Hybrid metaheuristics for the far from most string problem | |||

Source: | Proceedings of Hybrid Metaheuristics 2013 (HM 2013), Ischia, M.J. Blesa et al., (Eds.), Lecture Notes in Computer Science, vol. 7919, pp. 174-188, 2013 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | L.F. Morán-Mirabal, J.L. González-Velarde, and M.G.C. Resende | |||

Title: | Automatic tuning of GRASP with evolutionary path-relinking | |||

Source: | Proceedings of Hybrid Metaheuristics 2013 (HM 2013), Ischia, M.J. Blesa et al., (Eds.), Lecture Notes in Computer Science, vol. 7919, pp. 62-77, 2013 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | M.G.C. Resende and R.M.A. Silva | |||

Title: | GRASP: Procedimentos de busca gulosos, aleatórios e adaptativos | |||

Source: | Meta-Heurísticas em Pesquisa Operacional, H.S. Lopes, L.C.A. Rodrigues, and M.T.A. Steiner (Eds.), Chapter 1, pp. 1-20, Omnipax Editora, Curitiba, 2013. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | J.F. Gonçalves and M.G.C. Resende | |||

Title: | A biased random-key genetic algorithm for a 2D and 3D bin packing problem | |||

Source: | International J. of Production Economics, vol. 145, pp. 500-510, 2013. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | R. Martí, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | Multi-start methods for combinatorial optimization | |||

Source: | European J. of Operational Research, vol. 226, pp. 1-8, 2013 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | P. Festa and M.G.C. Resende | |||

Title: | Hybridizations of GRASP with path-relinking | |||

Source: | Hybrid Metaheuristics, E-G. Talbi, Editor, Studies in Computational Intelligence, vol. 434, pp. 135-155, 2013, Springer | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

2012 | ||||

SPACE | ||||

Authors: | R.M.A Silva, M.G.C. Resende, P.M. Pardalos, and J.F. Gonçalves | |||

Title: | Biased random-key genetic algorithm for bound-constrained global optimization | |||

Source: | Proceedings of Global Optimization Workshop (GOW 2012), pp. 133-136, Natal, Brazil, 2012 | |||

Links: | [ abstract | PDF ] | |||

SPACE | ||||

Authors: | Mauricio G. C. Resende, Geraldo R. Mateus, and Ricardo M. A. Silva | |||

Title: | GRASP: Busca gulosa, aleatorizada e adaptativa | |||

Source: | Manual de computação evolutiva e metaheurística, A. Gaspar-Cunha, R. Takahashi, and C.H. Antunes (Eds.), pp. 201-213, Coimbra University Press, 2012 | |||

Links: | [ abstract | PDF ] | |||

SPACE | ||||

Authors: | D.V. Andrade, M.G.C. Resende, and R.F. Werneck | |||

Title: | Fast local search for the maximum independent set problem | |||

Source: | J. of Heuristics, vol. 18, pp. 525-547, 2012 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Author: | Celso C. C. Ribeiro and Mauricio G. C. Resende | |||

Title: | Path-relinking intensification methods for stochastic local search algorithms | |||

Source: | J.
of Heuristics, vol. 18, pp. 193-214, 2012 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Author: | Mauricio
G. C. Resende | |||

Title: | Biased random-key genetic algorithms with applications in telecommunications | |||

Source: | TOP, vol. 20, pp. 120-153, 2012 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | M.G.C. Resende, R.F. Toso, J.F. Gonçalves, and R.M.A. Silva | |||

Title: | A biased random-key genetic algorithm for the Steiner triple covering problem | |||

Source: | Optimization Letters, vol. 6, pp. 605-619, 2012 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | M.G. Ravetti, C. Riveros, A. Mendes, M.G.C. Resende, and P.M. Pardalos | |||

Title: | Parallel hybrid heuristics for the permutation flow shop problem | |||

Source: | Annals
of Operations Research, vol. 199, pp. 269-284, 2012 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | J.F. Gonçalves and M.G.C. Resende | |||

Title: | A parallel multi-population biased random-key genetic algorithm for a container loading problem | |||

Source: | Computers and Operations Research, vol. 29, pp. 179-190, 2012. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

2011 | ||||

SPACE | ||||

Authors: | C. Martinez, I. Loiseau, M.G.C. Resende, and S. Rodriguez | |||

Title: | BRKGA
algorithm for the capacitated arc routing
problem | |||

Source: | Electronic Notes in Theoretical Computer Science, vol. 281, pp. 69-83, 2011 | |||

Links: | [ abstract | DOI ] | |||

SPACE | ||||

Authors: | W.A. Chaovalitwongse, C.A. Oliveira, B. Chiarini, P.M. Pardalos, and M.G.C. Resende | |||

Title: | Revised GRASP with path-relinking for the linear ordering problem | |||

Source: | J. of Combinatorial Optimization, vol. 22, pp. 572-593, 2011 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | J.F. Gonçalves, M.G.C. Resende, and J.J.M. Mendes | |||

Title: | A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem | |||

Source: | J. of Heuristics, vol.17, pp. 467-486, 2011 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | J.F. Gonçalves and M.G.C. Resende | |||

Title: | Biased random-key genetic algorithms for combinatorial optimization | |||

Source: | J. of Heuristics, vol. 17, pp. 487-525, 2011 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | G.R. Mateus, R.M.A. Silva, and M.G.C. Resende | |||

Title: | GRASP with path-relinking for the generalized quadratic assignment problem | |||

Source: | J. of Heuristics, vol.17, pp. 527-565, 2011 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | A. Duarte, R. Martí, , M.G.C. Resende, and R.M.A. Silva | |||

Title: | GRASP with path relinking heuristics for the antibandwidth problem | |||

Source: | Networks, vol. 58, pp. 171-189, 2011. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | J.F. Gonçalves and M.G.C. Resende | |||

Title: | A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem | |||

Source: | J.
of Combinatorial Optimization, vol. 22, pp. 180-201, 2011. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | M.J. Hirsch, P.M. Pardalos, and M.G.C. Resende | |||

Title: | Correspondence of projected 3D points and lines using a continuous GRASP | |||

Source: | International Transactions in Operational Research, vol. 18, pp. 493-511, 2011. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | T.F. Noronha, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | A biased random-key genetic algorithm for routing and wavelength assignment | |||

Source: | Journal of Global Optimization, vol. 50, pp. 503-518, 2011 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | R. Reis, M. Ritt, L.S. Buriol, and M.G.C. Resende | |||

Title: | A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion | |||

Source: | International Transactions in Operational Research, vol. 18, pp. 401-423, 2011. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | R.M.D. Frinhani, R.M.A. Silva, G.R. Mateus, P. Festa, and M.G.C. Resende | |||

Title: | GRASP with path-relinking for data clustering: a case study for biological data | |||

Source: | Experimental Algorithms, Proceedings of the 10th International Symposium (SEA 2011), Lecture Notes in Computer Science, vol. 6630, pp. 410-420, 2011. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | D.M. Silva, R.M.A. Silva, G.R. Mateus, J.F. Gonçalves, M.G.C. Resende, and P. Festa | |||

Title: | An iterative refinement algorithm for the minimum branch vertices problem | |||

Source: | Experimental Algorithms, Proceedings of the 10th International Symposium (SEA 2011), Lecture Notes in Computer Science, vol. 6630, pp. 421-433, 2011. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | M.G.C. Resende and C.C. Ribeiro | |||

Title: | Restart strategies for GRASP with path-relinking heuristics | |||

Source: | Optimization Letters, vol. 5, pp. 467-478, 2011. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | L.S. Pessoa, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | Experiments with LAGRASP heuristic for set k-covering | |||

Source: | Optimization Letters, vol. 5, pp. 407-419, 2011. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | P. Festa and M.G.C. Resende | |||

Title: | Effective application of GRASP | |||

Source: | Encyclopedia of Operations Research and Management Science, J.J. Cochran, L.A. Cox, Jr., P. Keskinocak, J.P. Kharoufeh, and J.C. Smith (Eds.), vol. 3, pp. 1609-1617, Wiley, 2011. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | M.G.C. Resende and R.M.A. Silva | |||

Title: | GRASP: Greedy randomized adaptive search procedures | |||

Source: | Encyclopedia of Operations Research and Management Science, J.J. Cochran, L.A. Cox, Jr., P. Keskinocak, J.P. Kharoufeh, and J.C. Smith (Eds.), vol. 3, pp. 2118-2128, Wiley, 2011. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | P. Festa and M.G.C. Resende | |||

Title: | GRASP: Basic components and enhancements | |||

Source: | Telecommunication Systems, vol. 46, pp. 253-271, 2011 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: |
| |||

Title: | Disjoint-path facility location: Theory and practice | |||

Source: |
| |||

Links: | [ abstract | PDF ] | |||

SPACE | ||||

2010 | ||||

SPACE | ||||

Author: | M. Fonseca, J.R.Figueira, and M.G.C. Resende | |||

Title: | Solving scalarized multi-objective network flow problems with an interior point method | |||

Source: | International Transactions in Operational Research, vol. 17, pp. 607-636, 2010 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Author: | E.G. Birgin, E.M. Gozzi, M.G.C. Resende, and R.M.A. Silva | |||

Title: | Continuous GRASP with a local active-set method for bound-constrained global optimization | |||

Source: | J. of Global Optimization, vol. 48, pp. 289-310, 2010 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | L.S. Buriol, M.J. Hirsch, T. Querido, P.M. Pardalos, M.G.C. Resende, and M. Ritt | |||

Title: | A biased random-key genetic algorithm for road congestion minimization | |||

Source: | Optimization Letters, vol. 4, pp. 619-633, 2010 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | L.S. Pessoa, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | A hybrid Lagrangean heuristic with GRASP and path-relinking for set K-covering | |||

Source: | Proceedings of Matheuristics 2010, Vienna, June 2010. | |||

Links: | [ abstract | PDF ] | |||

SPACE | ||||

Authors: | M. G. C. Resende, C. C. Ribeiro, F. Glover, and R. Martí | |||

Title: | Scatter search and path-relinking: Fundamentals, advances, and applications | |||

Source: | Handbook of Metaheuristics, 2nd Edition, M. Gendreau and J.-Y. Potvin, Eds., Springer, pp. 87-107, 2010. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | M.G.C. Resende and C.C. Ribeiro | |||

Title: | Greedy randomized adaptive search procedures: Advances and applications | |||

Source: | Handbook of Metaheuristics, 2nd Edition, M. Gendreau and J.-Y. Potvin (Eds.), Springer, pp. 281-317, 2010. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | P. Festa and M.G.C. Resende | |||

Title: | Hybrid GRASP heuristics | |||

Source: | in "Foundations of Computational Intelligence," A. Abraham, A.-E. Hassanien, P. Siarry, and A. Engelbrecht (Eds.), vol. 3, pp. 75-100, Springer, New York, 2010 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | P. Festa, J.F. Gonçalves, M.G.C. Resende, and R.M.A. Silva | |||

Title: | Automatic tuning of GRASP with path-relinking heuristics with a biased random-key genetic algorithm | |||

Source: | Experimental Algorithms, P. Festa (ed.), Lecture Notes in Computer Science, vol. 6049, pp. 338-349, 2010. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | M.J. Hirsch, P.M. Pardalos, and M.G.C. Resende | |||

Title: | Speeding up continuous GRASP | |||

Source: | European J. of Operational Research, vol. 205, pp. 507-521, 2010. | |||

Links: | [abstract | PDF | DOI ] | |||

SPACE. | ||||

Authors: | M.C.V. Nascimento, M.G.C. Resende, and F.M.B. Toledo | |||

Title: | GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem | |||

Source: | European J. of Operational Research, vol. 200, pp. 747-754, 2010. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | M.G.C. Resende, R. Martí, M. Gallego, and A. Duarte | |||

Title: | GRASP and path relinking for the max-min diversity problem | |||

Source: | Computers and Operations Research, vol. 37, pp. 498-508, 2010 | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

2009 | ||||

SPACE | ||||

Authors: | L.S. Buriol, M.J. Hirsch, P.M. Pardalos, T. Querido, M.G.C. Resende, and M. Ritt | |||

Title: | A hybrid genetic algorithm for road congestion minimization | |||

Source: | Proceedings of the XLI Symposium of the Brazilian Operational Research Society (XLI SBPO), September, 2009 | |||

Links: | [ abstract | PDF ] | |||

SPACE | ||||

Authors: | M.J. Hirsch, P.M. Pardalos, and M.G.C. Resende | |||

Title: | Solving systems of nonlinear equations with continuous GRASP | |||

Source: | Nonlinear Analysis: Real World Applications, vol. 10, pp. 2000-2006, 2009. | |||

Links: | [ abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | P. Festa and M. G. C. Resende | |||

Title: | An annotated bibliography of GRASP, Part I: Algorithms | |||

Source: | International Transactions in Operational Research, vol. 16, pp. 1-24, 2009 | |||

Links: | [abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | P. Festa and M. G. C. Resende | |||

Title: | An annotated bibliography of GRASP, Part II: Applications | |||

Source: | International Transactions in Operational Research, vol. 16, pp. 131-172, 2009 | |||

Links: | [abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | J.F. Gonçalves, J.J.M. Mendes, and M.G.C. Resende | |||

Title: | A random key based genetic algorithm for the resource constrained project scheduling problems | |||

Source: | Computers and Operations Research, vol. 36, pp. 92-109, 2009 | |||

Links: | [abstract | PDF] | |||

SPACE | ||||

Authors: | A.S. da Cunha, A. Lucena, N. Maculan, and M.G.C. Resende | |||

Title: | A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs | |||

Source: | Discrete Applied Mathematics, vol. 157, pp. 1198-1217, 2009 | |||

Links: | [abstract | PDF | DOI ] | |||

SPACE | ||||

## 2008 | ||||

SPACE | ||||

Authors: | L. F. Portugal, M. G. C. Resende, G. Veiga, J. Patrício,and J. J. Júdice | |||

Title: | Fortran subroutines for network flow optimization using an interior point algorithm | |||

Source: | Pesquisa Operacional, vol. 28 pp. 243-261, 2008 | |||

Links: | [abstract | PDF] | |||

SPACE | ||||

Author: | M.G.C. Resende | |||

Title: | Metaheuristic hybridization with Greedy Randomized Adaptive Search Procedures | |||

Source: | TutORials in Operations Research, Zhi-Long Chen and S. Raghavan (Eds.), pp. 295-319, INFORMS, 2008 | |||

Links: | [ abstract | PDF ] | |||

SPACE | ||||

Authors: | M.J. Hirsch, C.N. Meneses, P.M. Pardalos, M.A. Ragle, and M.G.C. Resende | |||

Title: | A continuous GRASP to determine the relationship between drugs and adverse reactions | |||

Source: | Data Mining, Systems Analysis and Optimization in Biomedicine, O. Seref, O.Erhun Kundakcioglu, and P.M. Pardalos (eds.),.AIP Conference Proceedings, vol. 953, pp. 106-121, Springer, 2008. | |||

Links: | [abstract | PDF] | |||

SPACE | ||||

Authors: | J.F. Gonçalves, J.J.M. Mendes, and M.G.C. Resende | |||

Title: | A genetic algorithm for the resource constrained multi-project scheduling problem | |||

Source: | European J. of Operational Research, vol. 189, pp. 1171-1190, 2008. | |||

Links: | [abstract | PDF] | |||

SPACE | ||||

Authors: | C. Commander. P. Festa, C.A.S. Oliveira, P.M. Pardalos, M.G.C. Resende, and M. Tsitselis | |||

Title: | GRASP with path-relinking for the cooperative communication problem on ad hoc networks | |||

Source: | Cooperative Networks: Control and Optimization, D.A. Grundel, R.A. Murphey, P.M. Pardalos, and O.A. Prokopyev (editors), Edward Elgar Publishing, Chapter 10, pp. 187-207, 2008 | |||

Links: | [abstract | PDF] | |||

SPACE | ||||

Authors: | T.F. Noronha, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | Efficient implementations of heuristics for routing and wavelength assignment | |||

Source: | Proceedings of 7th International Workshop on Experimental Algorithms (WEA 2008), C.C. McGeoch (Ed.), LNCS, vol. 5038, pp. 169-180, Springer, 2008. | |||

Links: | [ abstract | PDF ] | |||

SPACE | ||||

Authors: | D.V. Andrade, M.G.C. Resende, and R.F. Werneck | |||

Title: | Fast local search for the maximum independent set problem | |||

Source: | Proceedings of 7th International Workshop on Experimental Algorithms (WEA 2008), C.C. McGeoch (Ed.), LNCS, vol. 5038, pp. 220-234, Springer, 2008. | |||

Links: | [ abstract | PDF ] | |||

SPACE | ||||

Authors: | L.S. Buriol, M.G.C. Resende, and M. Thorup | |||

Title: | Speeding up dynamic shortest path algorithms | |||

Source: | INFORMS J. on Computing, vol. 20, No. 2, pp. 191–204, 2008. | |||

Links: | [abstract | PDF] | |||

SPACE | ||||

## 2007 | ||||

> | SPACE | |||

Authors: | C.A. Oliveira, P.M. Pardalos, O. Prokopyev, and M.G.C. Resende | |||

Title: | Streaming cache placement problems: Complexity and algorithms | |||

Source: | International J. of COmputational Science and Engineering, vol. 3, pp. 173-183, 2007. | |||

Links: | [ abstract | PDF ] | |||

SPACE | ||||

Authors: | C.W. Commander, C.A.S. Oliveira, P.M. Pardalos, and M.G.C. Resende. | |||

Title: | A one-pass heuristic for cooperative communication in mobile ad hoc networks | |||

Source: | Cooperative Systems: Control and Optimization, D.A. Grundel, R.A. Murphey, P.M. Pardalos, and O.A. Prokopyev (editors), pp. 285-296, Springer, 2007. | |||

Links: | [ abstract | PDF ] | |||

SPACE | ||||

Authors: | M.G.C. Resende | |||

Title: | An optimizer in the telecommunications industry | |||

Source: | SIAM SIAG/Optimization Views-and-News, vol. 18. no. 2, pp. 8-19, 2007. | |||

Links: | [abstract | PDF] | |||

SPACE | ||||

Authors: |
| |||

Title: | TIE Breaking: Tunable Interdomain Egress Selection | |||

Source: | IEEE/ACM Transactions on Networking, vol. 15, issue 4, pp. 761 - 774, 2007 [doi 10.1109/TNET.2007.893877] | |||

Links: | [abstract | PDF] | |||

SPACE | ||||

Authors: | T.F. Noronha, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | A random-keys genetic algorithm for routing and wavelength assignment | |||

Source: | Proc. of Seventh Metaheuristics International Conference (MIC 2007) | |||

Links: | [abstract | PDF] | |||

SPACESPACE | ||||

Authors: | D.V. Andrade and M.G.C. Resende | |||

Title: | GRASP with evolutionary path-relinking | |||

Source: | Proc. of Seventh Metaheuristics International Conference (MIC 2007) | |||

Links: | [abstract | PDF] | |||

SPACE | ||||

Authors: | D.V. Andrade and M.G.C. Resende | |||

Title: | GRASP with path-relinking for network migration scheduling | |||

Source: | Proc. of International Network Optimization Conference (INOC 2007) | |||

Links: | [abstract | PDF] | |||

SPACE | ||||

Authors: | M.J. Hirsch, C.N. Meneses, P.M. Pardalos, and M.G.C. Resende | |||

Title: | Global optimization by continuous GRASP | |||

Source: | Optimization Letters, vol. 1, pp. 201-212, 2007 [doi:10.1007/s11590-006-0021-6] | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | M.G.C. Resende and R.F. Werneck | |||

Title: | A fast swap-based local search procedure for location problems | |||

Source: | Annals of Operations Research, vol. 150, pp. 205-230, 2007 [doi:10.1007/s10479-006-0154-0] | |||

Links: | [abstract |PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | L.S. Buriol, M.G.C. Resende, and M. Thorup | |||

Title: | Survivable IP network design with OSPF routing | |||

Source: | Networks, vol. 49, pp. 51-64, 2007 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | TTTPLOTS: A perl program to create time-to-target plots | |||

Source: | Optimization Letters, vol. 1, pp. 355-366, 2007 [doi:10.1007/s11590-006-0031-4] | |||

Links: | [Abstract | PDF | Google Scholar citations ] | |||

SPACE | ||||

## 2006 | ||||

> | SPACE | |||

Authors: | P. Festa, P.M. Pardalos, L.S. Pitsoulis, and M. G. C. Resende | |||

Title: | GRASP with path-relinking for the weighted MAXSAT problem | |||

Source: | ACM J. of Experimental Algorithmics, vol. 11, article 2.4, 2006, 1-16. | |||

Links: | [abstract | PDF] | |||

SPACE | ||||

Authors: | M.G.C. Resende and P.M. Pardalos, Eds. | |||

Title: | Handbook of Optimization in Telecommunication | |||

Source: | Springer Science + Business Media, 2006 | |||

Links: | [contents | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | M.J. Hirsch, P.M. Pardalos, and M.G.C. Resende | |||

Title: | Sensor registration in a sensor network by continuous GRASP | |||

Source: | IEEE Military Communications Conference (MILCOM 2006), 2006 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | M.G.C. Resende and R.F. Werneck | |||

Title: | A hybrid multistart heuristic for the uncapacitated facility location problem | |||

Source: | European J. of Operational Research, vol. 174, pp. 54-68, 2006 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | C.A.S. Oliveira, P.M. Pardalos, and M.G.C. Resende | |||

Title: | Optimization problems in multicast tree construction | |||

Source: | Handbook of Optimization in Telecommunications, M.G.C. Resende and P.M. Pardalos (eds.), Springer, pp. 701-731, 2006 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | D.V. Andrade, L.S. Buriol, M.G.C. Resende, and M. Thorup | |||

Title: | Survivable composite-link IP network design with OSPF routing | |||

Source: | The Eighth INFORMS Telecommunications Conference, Dallas, Texas, April 2006 | |||

Links: | [Abstract | PDF] | |||

> | SPACE | |||

Authors: | D.V. Andrade and M.G.C. Resende | |||

Title: | A GRASP for PBX telephone migration scheduling | |||

Source: | The Eighth INFORMS Telecommunications Conference, Dallas, Texas, April 2006 | |||

Links: | [Abstract | PDF] | |||

> | SPACE | |||

Authors: | C. Commander. P. Festa, C.A.S. Oliveira, P.M. Pardalos, M.G.C. Resende, and M. Tsitselis | |||

Title: | A greedy randomized algorithm for the cooperative communication problem on ad hoc networks | |||

Source: | The Eighth INFORMS Telecommunications Conference, Dallas, Texas, April 2006 | |||

Links: | [abstract | PDF] | |||

> | SPACE | |||

Authors: | D.V. Andrade, L.S. Buriol, M.G.C. Resende, and M. Thorup | |||

Title: | Survivable composite-link IP network design with OSPF routing | |||

Source: | The Eighth INFORMS Telecommunications Conference, Dallas, Texas, April 2006 | |||

Links: | [abstract | PDF] | |||

> | SPACE | |||

Authors: | C.N. Meneses, P.M. Pardalos, M.G.C. Resende, and A. Vazacopoulos | |||

Title: | Modeling and solving string selection problems | |||

Source: | Proceedings of the 2005 International Symposium on Mathematical and Computational Biology - BIOMAT 2005, R. Mondaini and R. Dilão (Eds.), E-papers Serviços Editoriais Ltda., Rio de Janeiro, 2006. | |||

Links: | [ abstract | PDF ] | |||

> | SPACESPACE | |||

## 2005 | ||||

> | SPACE | |||

Authors: | R. Teixeira, T.G. Griffin, M.G.C. Resende, and J. Rexford | |||

Title: | TIE Breaking: Tunable Interdomain Egress Selection | |||

Source: | CoNEXT, ACM Conference on Emerging Network Experiment and Technology (CoNEXT 2005), Toulouse, France, pp. 93-104, ACM Press, 2005 | |||

Links: | [abstract | PDF | Google Scholar citations ]. | |||

> | SPACE | |||

Authors: | C. Commander. C.A.S. Oliveira, P.M. Pardalos, and M.G.C. Resende | |||

Title: | A GRASP heuristic for the cooperative communication problem in ad hoc networks | |||

Source: | VI International Metaheuristics Conference, pp. 225-230, Vienna, Austria, 2005 | |||

Links: | [abstract | PDF file] | |||

> | SPACE | |||

Authors: | M.G.C. Resende and C.C. Ribeiro | |||

Title: | Parallel Greedy Randomized Adaptive Search Procedures | |||

Source: | in "Parallel Metaheuristics: A new class of algorithms," E. Alba, (Ed.), John Wiley and Sons, pp. 315-346, 2005 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | L.S. Buriol, M.G.C. Resende, Celso C. Ribeiro, and M. Thorup | |||

Title: | A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing | |||

Source: | Networks, vol. 46, no. 1, pp. 36-56, 2005 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | ||||

Authors: | R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo | |||

Title: | GRASP with path relinking for three-index assignment | |||

Source: | INFORMS J. on Computing, vol. 17, no. 2, pp. 224-247, 2005 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | P. Festa, P.M. Pardalos, L.S. Pitsoulis, and M. G. C. Resende | |||

Title: | GRASP with path-relinking for the weighted maximum satisfiability problem | |||

Source: | Proceedings
of IV Workshop on Efficient and Experimental Algorithms (WEA2005), S.E. Nikoletseas (Ed.), Lecture Notes in Computer Science, vol. 3503, pp. 367-379, 2005 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACESPACE | |||

Authors: | R.M. Aiex and M.G.C. Resende | |||

Title: | Parallel strategies for GRASP with path-relinking | |||

Source: | in "Metaheuristics: Progress as Real Problem Solvers," T. Ibaraki, K. Nonobe and M. Yagiura, (Eds.), Springer, pp. 301-331, 2005 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | M.G.C. Resende and C.C. Ribeiro | |||

Title: | GRASP with path-relinking: Recent advances and applications | |||

Source: | in "Metaheuristics: Progress as Real Problem Solvers," T. Ibaraki, K. Nonobe and M. Yagiura, (Eds.), Springer, pp. 29-63, 2005 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | J.F. Gonçalves, J.J.M. Mendes, and M.G.C. Resende | |||

Title: | A hybrid genetic algorithm for the job shop scheduling problem | |||

Source: | European J. of Operational Research, vol. 167, pp. 77-95, 2005 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | H. Faria Jr., S. Binato, M.G.C. Resende, and D.J. Falcão | |||

Title: | Transmission network design by a greedy randomized adaptive path relinking approach | |||

Source: | IEEE Transactions on Power Systems, vol. 20, no. 1, pp. 43-49, 2005 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

## 2004 | ||||

> | SPACE | |||

Authors: | J.F. Gonçalves and M.G.C. Resende | |||

Title: | An evolutionary algorithm for manufacturing cell formation | |||

Source: | Computers and Industrial Engineering. vol. 47, pp. 247-273, 2004. | |||

Links: | [ abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | A. Lucena and M.G.C. Resende | |||

Title: | Strong lower bounds for the prize collecting Steiner problem in graphs | |||

Source: | Discrete Applied Mathematics, vol. 141, pp. 277-294, 2004. | |||

Links:: | [ abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | C.A. Oliveira, P.M. Pardalos, and M.G.C. Resende | |||

Title: | GRASP with path-relinking for the quadratic assignment problem | |||

Source: | in "Efficient and Experimental Algorithms," C.C. Ribeiro and S.L. Martins (Eds.), Lecture Notes in Computer Science, vol. 3059, pp. 356--368, Springer-Verlag, 2004 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | M.G.C. Resende and R.F. Werneck | |||

Title: | A hybrid heuristc for the p-median problem | |||

Source: | J. of Heuristics, vol. 10, pp. 59-88, 2004. | |||

Links: | [ abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

## 2003 | ||||

> | SPACE | |||

Authors: | M.G.C. Resende and J.P. de Sousa | |||

Title: | Metaheuristics: Computer Decision-Making | |||

Source: | Kluwer Academic Publishers, December 2003 | |||

Links: | [ content | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | A.S. da Cunha, A. Lucena, N. Maculan, and M.G.C. Resende | |||

Title: | A relax and cut algorithm for the prize collecting Steiner problem in graphs | |||

Source: | Proceedings of Mathematical Programming in Rio, pp. 72-78, Búzios, Rio de Janeiro, Brazil, 2003 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | L.S. Buriol, P.M. França, M.G.C. Resende, and M, Thorup | |||

Title: | Network design for OSPF routing | |||

Source: | Proceedings of Mathematical Programming in Rio, pp. 40-44, Búzios, Rio de Janeiro, Brazil, 2003 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | M.G.C. Resende and J.L. González Velarde | |||

Title: | GRASP: Procedimientos de búsqueda miope aleatorizado y adaptatitvo | |||

Source: | Inteligencia Artificial, no. 19, pp. 61-76, 2003 | |||

Links: | [abstract | PDF] | |||

> | SPACE | |||

Authors: | M.G.C. Resende and G. Veiga | |||

Title: | An annotated bibliography of network interior point methods | |||

Source: | Networks, vol. 42, pp. 114-121, 2003 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | M.G.C. Resende and C.C. Ribeiro | |||

Title: | GRASP and path-relinking: Recent advances and applications | |||

Source: | Proceedings of MIC2003 | |||

Links: | [abstract | PDF] | |||

> | SPACE | |||

Authors: | M.G.C. Resende | |||

Title: | Combinatorial optimization in telecommunications | |||

Source: | Optimization and Industry: New Frontiers, P.M. Pardalos and V. Korotkich, eds., Kluwer Academic Publishers, pp. 59-112, 2003 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | M.G.C. Resende and R.F. Werneck | |||

Title: | On
the implementation of a swap-based local search procedure for the p-median problem | |||

Source: | Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (ALENEX'2003), Richard E. Ladner (Ed.), SIAM, Philadelphia, pp. 119-127, 2003 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | R.M. Aiex, S. Binato, and M.G.C. Resende | |||

Title: | Parallel GRASP with path-relinking for job shop scheduling | |||

Source: | Parallel Computing, vol. 29, pp. 393-430, 2003 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | J. J. Judice, J. Patricio, L. F. Portugal, M. G. C. Resende, and G. Veiga | |||

Title: | A study of preconditioners for network interior point methods | |||

Source: | Computational Optimization and Applications, vol. 24, pp. 5-35, 2003 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | M. G. C. Resende and C. C. Ribeiro | |||

Title: | A GRASP with path-relinking for private virtual circuit routing | |||

Source: | Networks, vol. 41, pp. 104-114, 2003 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

Authors: | M. G. C. Resende and C. C. Ribeiro | |||

Title: | Greedy randomized adaptive search procedures | |||

Source: | in "Handbook of Metaheuristics," F. Glover and G. Kochenberger, eds., Kluwer Academic Publishers, pp. 219-249, 2003 | |||

Links: | [abstract | PDF | Google Scholar citations ] | |||

> | SPACE | |||

## 2002 | ||||

SPACE | ||||

Authors: | J. Abello, M.G.C. Resende, and S. Sudarsky | |||

Title: | Massive quasi-clique detection | |||

Source: | LATIN 2002: Theoretical Informatics, S. Rajsbaum (Ed.), Lecture Notes in Computer Science, vol. 2286, pp. 598-612, Springer Verlag, 2002 | |||

Links: | [abstract | PDF file | DjVu file] | |||

SPACE | ||||

Authors: | P. Festa, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | Randomized heuristics for the MAX-CUT problem | |||

Source: | Optimization Methods and Software, vol. 7, pp. 1033-1058, 2002 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Editors: | J. Abello, P.M. Pardalos and M.G.C. Resende | |||

Title: | Handbook of Massive Data Sets | |||

Source: | Kluwer Academic Publishers, May 2002 | |||

Links: | [content] | |||

SPACE | ||||

Editors: | P.M. Pardalos and M.G.C. Resende | |||

Title: | Handbook of Applied Optimization | |||

Source: | Oxford University Press, March 2002 | |||

Links: | [content] | |||

SPACE | ||||

Authors: | M. Ericsson, M.G.C. Resende and P.M. Pardalos | |||

Title: | A genetic algorithm for the weight setting problem in OSPF routing | |||

Source: | J. of Combinatorial Optimization, vol. 6, pp. 299-333, 2002 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Authors: | L. S. Pitsoulis and M.G.C. Resende | |||

Title: | Greedy randomized adaptive search procedures | |||

Source: | Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende, Eds., Oxford University Press, pp. 168-183, 2002 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Authors: | S. Duni Ekisoglu, P.M. Pardalos, and M.G.C. Resende | |||

Title: | Parallel metaheuristics for combinatorial optimization | |||

Source: | Models for Parallel and Distributed Computation - Theory, Algorithmic Techniques and Applications, R. Correa et al., Eds., Kluwer Academic Publishers, pp. 179-206, 2002 | |||

Links: | [abstract | PDF | DOI ] | |||

SPACE | ||||

Authors: | R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | Probability distribution of solution time in GRASP: An experimental investigation | |||

Source: | J. of Heuristics, vol. 8, pp. 343-373, 2002 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Authors: | S. Binato, W.J. Hery, D.M. Loewenstern, and M.G.C. Resende | |||

Title: | A GRASP for job shop scheduling | |||

Source: | Essays and Surveys on Metaheuristics, C.C. Ribeiro and P. Hansen, Eds., Kluwer Academic Publishers, pp. 58-79, 2002 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Authors: | P. Festa and M.G.C. Resende | |||

Title: | GRASP: An annotated bibliography | |||

Source: | Essays and Surveys on Metaheuristics, C.C. Ribeiro and P. Hansen, Eds., Kluwer Academic Publishers, pp. 325-367, 2002 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Authors: | M.C. Medeiros, A. Veiga, and M.G.C. Resende | |||

Title: | A combinatorial approach to piecewise linear time series analysis | |||

Source: | J. of Computational and Graphical Statistics, vol. 11, pp. 236-258, 2002 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Authors: | K.G. Ramakrishnan, M.G.C. Resende, B. Ramachandran, and J.F. Pekny | |||

Title: | Tight QAP bounds via linear programming | |||

Source: | Combinatorial and Global Optimization, P.M. Pardalos, A. Migdalas, and R.E. Burkard, eds.,World Scientific Publishing Co., Singapore, pp. 297-303, 2002 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Authors: | L.S. Buriol, M.G.C. Resende, C.C. Ribeiro, and M. Thorup | |||

Title: | A memetic algorithm for OSPF routing | |||

Source: | INFORMS Conference on Telecommunications, Boca Raton, Florida, March 2002 | |||

Links: | [PDF file] | |||

SPACE | ||||

2001 | ||||

SPACE | ||||

Authors: | S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro | |||

Title: | Local search with perturbations for the prize-collecting Steiner tree problem in graphs | |||

Source: | Networks, vol. 38, pp. 50-58, 2001 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Authors: | J. Abello, S. Butenko, P.M. Pardalos, and M.G.C. Resende | |||

Title: | Finding independent sets in a graph using continuous multivariable polynomial formulations | |||

Source: | J. of Global Optimization, vol. 21, pp. 111-137, 2001 | |||

Links: | [abstract | PDF file | DjVu file] | |||

SPACE | ||||

Authors: | P. Festa, P.M. Pardalos, and M.G.C. Resende | |||

Title: | Feedback set problems | |||

Source: | Encyclopedia of Optimization, Kluwer Academic Press, vol. 2, pp. 94-106, 2001 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Authors: | P. Festa, P.M. Pardalos, and M.G.C. Resende | |||

Title: | Algorithm 815: Fortran subroutines for computing approximate solutions of feedback set problems using GRASP | |||

Source: | ACM Transactions on Mathematical Software, vol. 27, pp. 456-464, 2001 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Authors: | M.C. Medeiros, M.G.C. Resende, and A. Veiga | |||

Title: | Piecewise linear time series estimation with GRASP | |||

Source: | Computational Optimization and Applications," vol. 19, pp. 127-144, 2001 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Author: | M.G.C. Resende | |||

Title: | Greedy randomized adaptive search procedures (GRASP) | |||

Source: | Encyclopedia of Optimization, C. Floudas and P.M. Pardalos, eds., Kluwer Academic Press, vol. 2, pp. 373-382, 2001 | |||

Links: | [abstract | PDF file] | |||

SPACE | ||||

Authors: | M.G.C. Resende and C.C. Ribeiro | |||

Title: | Graph planarization | |||

Source: | Encyclopedia of Optimization, C. Floudas and P.M. Pardalos, eds., Kluwer Academic Press, vol. 2, pp. 368-373, 2001 | |||

Links: | [abstract | PS file] | |||

SPACE |

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 [abstract | PDF file]

R.A. Murphey, P.M. Pardalos, and M.G.C. Resende, Frequency assignment problems, Handbook of Combinatorial Optimization, D.-Z. Du and P.M. Pardalos, Eds., Kluwer Academic Publishers, Supplement vol. A, pp. 295-377, 2000 [abstract | PS file]

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 [abstract | PDF file]

L.F. Portugal, M.G.C. Resende, G. Veiga, and J.J. Judice, A truncated primal-infeasible dual-feasible network interior point method, Networks, vol. 35, pp. 91--108, 2000 [abstract | PDF file]

X. Liu, P.M. Pardalos, S. Rajasekaran, and M.G.C. Resende, A GRASP for frequency assignment in mobile radio networks, in "Mobile Networks and Computing," S.
Rajasekaran, P. M. Pardalos, and D.F. Hsu (Eds.), DIMACS Series on Discrete Mathematcs and Theoretical Computer Science, vol. 52, pp. 195-202, American
Mathematical Society, 2000

S.L. Martins, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro, Greedy
randomized adaptive search procedures for the Steiner problem in graphs, Randomization methods in algorithm design," P.M. Pardalos, S. Rajasekaran, and J. Rolim, Eds., DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 43, pp. 133-145, 1999 [abstract | PS file]

P.M. Pardalos, J. Rappe, and M.G.C. Resende, An exact parallel algorithm for the maxium clique problem, High performance algorithms and software in nonlinear optimization, R. De Leone et al. (eds.), Kluwer Academic Publishers, pp. 279-300, 1999 [abstract | PDF file]

C. C. Ribeiro, and M.G.C. Resende, M. G. C. Resende, Algorithm 797: FORTRAN Subroutines for Approximate Solution of Graph Planarization Problems using GRASP, ACM Transactions on Mathematical Software, vol. 25, pp. 341-352, 1999 [abstract | PS file]

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 [abstract | PDF file]

M.G.C. Resende, Computing approximate solutions of the maximum covering problem using GRASP, J. of Heuristics, vol. 4, pp. 161-171, 1998 [abstract | PDF file]

M.G.C. Resende, T.A. Feo, and S.H. Smith, Algorithm 787: FORTRAN Subroutines for Approximate Solution of the Maximum Independent Set Problem using GRASP, ACM Transactions on Mathematical Software, vol. 24, pp. 386-394, 1998 [abstract | PS file]

T. Mavridou, P.M. Pardalos, P.S. Pitsoulis, and M. G. C. Resende, A GRASP for the biquadratic assignment problem, European J. of Operational Research, vol. 105, pp. 613-621, 1998 [abstract | PDF file ]

P.M. Pardalos, P.S. Pitsoulis, and M. G. C. Resende, Algorithm
769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP, ACM Transactions on Mathematical Software, vol. 23, pp. 196-208, 1997 [abstract | PS file]

M.G.C. Resende and C.C. Ribeiro, A GRASP for graph planarization, Networks, vol. 29, pp. 173-189, 1997 [abstract | PDF | DOI ]

P.M. Pardalos, K.G. Ramakrishnan, M.G.C. Resende, and Y. Li, Implementation of a variance reduction based lower bound in a branch and bound algorithm for the quadratic assignment problem, SIAM Journal on Optimization, vol. 7, pp. 280-294, 1997 [abstract | PS file]

P.M. Pardalos and M.G.C. Resende, Interior point methods for global optimization, Interior point methods in mathematical programming, T. Terlaky, ed., Kluwer Academic Publishers, pp. 467-500, 1996 [abstract | PS file]

KG. Ramakrishnan, M.G.C. Resende, and P.M. Pardalos, A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming, State of the Art in Global Optimization: Computational Methods and Applications, C. Floudas and P.M. Pardalos, eds., pp. 57-73, Kluwer Academic Publishers, 1996 [abstract | PS file]

M.G.C. Resende and T.A. Feo, A GRASP for Satisfiability, 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 [abstract | PS file]

M.G.C. Resende, P.M. Pardalos, and Y. Li, Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP, ACM Transactions on Mathematical Software, vol. 22, pp. 104-118, 1996 [abstract | PDF file]

M.G.C. Resende and P.M. Pardalos, Interior point algorithms for network flow problems, Advances in Linear and Integer Programming, J.E. Beasley, ed., Oxford University Press, pp. 147-187, 1996 [abstract | PDF file | DjVu file]

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 [abstract | PDF file]

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 [abstract | PDF file]

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 [abstract | PS file]

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 [abstract | PDF file]

T.A. Feo and M.G.C. Resende, Greedy randomized adaptive search procedures, J. of Global Optimization, vol. 6, pp. 109-133, 1995 [abstract | PDF file

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 [abstract | PDF file]

M.G.C. Resende, T. Tsuchiya, and G. Veiga, Identifying the optimal face of a network linear program with a globally convergent interior point method, Large Scale Optimization: State of the Art, W.W. Hager, D.W. Hearn and P.M. Pardalos, eds., Kluwer, pp. 362-387, 1994 [ abstract | PDF ]

Y. Li, P.M. Pardalos, K.G. Ramakrishnan, and M.G.C. Resende, Lower bounds for the quadratic assignment problem, Annals of Operations Research, vol. 50, pp. 387-411, 1994 [abstract | PS file]

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 [abstract | PDF file]

A.P. Kamath, N.K. Karmarkar, K.G. Ramakrishnan, and M.G.C. Resende, An interior point approach to Boolean vector function synthesis, Proceedings of the 36th MSCAS, pp. 185-189, 1993 [abstract | PDF]

M.G.C. Resende and G. Veiga, An implementation of the dual affine scaling algorithm for minimum cost flow on bipartite uncapacitated networks, SIAM J. on Optimization, vol. 3, pp. 516-537, 1993 [abstract | PS file]

M.G.C. Resende and G. Veiga, Computing the projection in an interior point algorithm: An experimental comparison, Investigación
Operativa, vol. 3, pp. 81-92, 1993 [abstract | PS file]

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. 20, pp. 43-58, 1990 [abstract | PDF file]

I. Adler, N.K. Karmarkar, M.G.C. Resende, and G. Veiga, An implementation of Karmarkar's algorithm for linear programming, Mathematical Programming, vol. 44, pp. 297-335, 1989. Errata published in Mathematical Programming, vol. 50, pp. 415, 1991 [abstract | PS file]

I. Adler, N. 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 [abstract | PDF file]

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 [abstract | PDF file]

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 [ abstract | PDF file | DjVu file]

R.A. Zuanich, D.F. Ruffcorn, and M.G.C. Resende, Beyond
the spreadsheet - Wafer production planning with start demand rate calculation through simulation models, J. Electrochemical Society, vol. 135, pp. C371-C371, 1988 [back]

M.G.C. Resende, A computer program for reliability evaluation of large-scale networks via polygon-to-chain reductions, IEEE Transactions on Reliability, vol. R-35, pp. 24-29, 1986 [abstract | PDF file | DjVu
file]