default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMauricio G. C. Resende
Person information
- affiliation: Amazon.com, Seattle, Mathematical Optimization and Planning (MOP)
- affiliation: AT&T Labs Research, Middletown, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j124]Paola Festa, Luca Di Gaspero, Mario Pavone, Mauricio G. C. Resende:
Preface to the Special Issue on Metaheuristics: Recent Advances and Applications. Int. Trans. Oper. Res. 32(1): 5 (2025)- 2024
- [j123]Mateus C. Silva
, Rafael A. Melo, Mauricio G. C. Resende, Marcio Costa Santos, Rodrigo F. Toso:
Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be? Comput. Oper. Res. 168: 106703 (2024) - [j122]Alberto Francisco Kummer Neto, Olinto C. B. de Araújo, Luciana S. Buriol, Mauricio G. C. Resende:
A biased random-key genetic algorithm for the home health care problem. Int. Trans. Oper. Res. 31(3): 1859-1889 (2024) - [c40]Antonio Augusto Chaves, Mauricio G. C. Resende, Ricardo M. A. Silva:
A Continuous-GRASP Random-Key Optimizer. MIC (1) 2024: 15-20 - [i10]Paola Festa, Francesca Guerriero, Mauricio G. C. Resende, Edoardo Scalzo:
A biased random-key genetic algorithm with variable mutants to solve a vehicle routing problem. CoRR abs/2405.00268 (2024) - [i9]Mariana A. Londe, Luciana S. Pessoa, Cartlos E. Andrade, Mauricio G. C. Resende:
Early years of Biased Random-Key Genetic Algorithms: A systematic review. CoRR abs/2405.01765 (2024) - [i8]Antonio Augusto Chaves, Mauricio G. C. Resende, Ricardo M. A. Silva:
A random-key GRASP for combinatorial optimization. CoRR abs/2405.18681 (2024) - 2023
- [j121]Daniele Ferone, Paola Festa, Tommaso Pastore, Mauricio G. C. Resende:
Efficient GRASP solution approach for the Prisoner Transportation Problem. Comput. Oper. Res. 153: 106161 (2023) - [c39]Andersson A. Da Silva, Ricardo M. A. Silva, Amanda S. Xavier, Thiago Dias Bispo, Geraldo R. Mateus, Mauricio G. C. Resende:
cudaBRKGA-CNN: An Approach for Optimizing Convolutional Neural Network Architectures. CEC 2023: 1-8 - [i7]Mariana A. Londe, Luciana S. Pessoa, Carlos Eduardo de Andrade, Mauricio G. C. Resende:
Biased Random-Key Genetic Algorithms: A Review. CoRR abs/2312.00961 (2023) - [i6]Samyukta Sethuraman, Ankur Bansal, Setareh Mardan, Mauricio G. C. Resende, Timothy L. Jacobs:
Amazon Locker Capacity Management. CoRR abs/2312.06579 (2023) - 2022
- [j120]Dalila B. M. M. Fontes, Seyed Mahdi Homayouni, Mauricio G. C. Resende:
Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems. J. Comb. Optim. 44(2): 1284-1322 (2022) - [j119]Beatriz Brito Oliveira, Maria Antónia Carravilla, José Fernando Oliveira, Mauricio G. C. Resende:
A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation. Optim. Methods Softw. 37(3): 1065-1086 (2022) - [c38]Paola Festa, Francesca Guerriero, Mauricio G. C. Resende, Edoardo Scalzo:
A BRKGA with Implicit Path-Relinking for the Vehicle Routing Problem with Occasional Drivers and Time Windows. MIC 2022: 17-29 - [c37]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
A Local Search Algorithm for Large Maximum Weight Independent Set Problems. ESA 2022: 45:1-45:16 - [i5]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems. CoRR abs/2203.15805 (2022) - [i4]Martin J. A. Schuetz, John Kyle Brubaker, Henry Montagu, Yannick van Dijk, Johannes Klepsch, Philipp Ross, André Luckow, Mauricio G. C. Resende, Helmut G. Katzgraber:
Optimization of Robot Trajectory Planning with Nature-Inspired and Hybrid Quantum Algorithms. CoRR abs/2206.03651 (2022) - [i3]Alberto Francisco Kummer Neto, Olinto C. B. de Araújo, Luciana S. Buriol, Mauricio G. C. Resende:
A biased random-key genetic algorithm for the home health care problem. CoRR abs/2206.14347 (2022) - 2021
- [j118]Carlos Eduardo de Andrade, Rodrigo F. Toso, José Fernando Gonçalves, Mauricio G. C. Resende:
The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications. Eur. J. Oper. Res. 289(1): 17-30 (2021) - [j117]Larissa P. G. Petroianu, Zelda B. Zabinsky, Mariam Zameer, Yi Chu, Mamiza M. Muteia, Mauricio G. C. Resende, Aida L. Coelho, Jiarui Wei, Turam Purty, Abel Draiva, Alvaro Lopes:
A light-touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique. Int. Trans. Oper. Res. 28(5): 2334-2358 (2021) - [j116]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
New Instances for Maximum Weight Independent Set From a Vehicle Routing Application. Oper. Res. Forum 2(4) (2021) - [i2]Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
New instances for maximum weight independent set from a vehicle routing application. CoRR abs/2105.12623 (2021) - 2020
- [j115]David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. Oper. Res. 68(3): 896-926 (2020)
2010 – 2019
- 2019
- [j114]Fernando Stefanello, Vaneet Aggarwal, Luciana S. Buriol, Mauricio G. C. Resende:
Hybrid algorithms for placement of virtual machines across geo-separated data centers. J. Comb. Optim. 38(3): 748-793 (2019) - 2018
- [j113]Bernard Fortz, Dimitri Papadimitriou, Mauricio G. C. Resende:
Preface: Recent advances in telecommunications networks planning and operation. Networks 71(2): 95-96 (2018) - [e4]Rafael Martí, Panos M. Pardalos, Mauricio G. C. Resende:
Handbook of Heuristics. Springer 2018, ISBN 978-3-319-07123-7 [contents] - [r6]José Fernando Gonçalves, Mauricio G. C. Resende:
Biased Random-Key Genetic Progamming. Handbook of Heuristics 2018: 23-37 - [r5]Paola Festa, Mauricio G. C. Resende:
GRASP. Handbook of Heuristics 2018: 465-488 - [r4]José Fernando Gonçalves, Mauricio G. C. Resende:
Random-Key Genetic Algorithms. Handbook of Heuristics 2018: 703-715 - 2017
- [j112]Fernando Stefanello, Luciana S. Buriol, Michael J. Hirsch, Panos M. Pardalos, Tania Querido, Mauricio G. C. Resende, Marcus Ritt:
On the minimization of traffic congestion in road networks with tolls. Ann. Oper. Res. 249(1-2): 119-139 (2017) - [j111]Haroldo de Faria Jr., Mauricio G. C. Resende, Damien Ernst:
A biased random key genetic algorithm applied to the electric distribution network reconfiguration problem. J. Heuristics 23(6): 533-550 (2017) - [j110]Julliany S. Brandão, Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro:
A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems. Int. Trans. Oper. Res. 24(5): 1061-1077 (2017) - [j109]Luciana S. Pessoa, Andréa C. Santos, Mauricio G. C. Resende:
A biased random-key genetic algorithm for the tree of hubs location problem. Optim. Lett. 11(7): 1371-1384 (2017) - [c36]Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende:
On the fast solution of the p-center problem. ICTON 2017: 1-4 - [c35]Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende:
A New Local Search for the p-Center Problem Based on the Critical Vertex Concept. LION 2017: 79-92 - 2016
- [j108]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena, Edson Luiz França Senne, Mauricio G. C. Resende:
Hybrid method with CS and BRKGA applied to the minimization of tool switches problem. Comput. Oper. Res. 67: 174-183 (2016) - [j107]Ricardo B. Damm, Mauricio G. C. Resende, Débora P. Ronconi:
A biased random key genetic algorithm for the field technician scheduling problem. Comput. Oper. Res. 75: 49-63 (2016) - [j106]José Fernando Gonçalves, Mauricio G. C. Resende, Miguel Dias Costa:
A biased random-key genetic algorithm for the minimization of open stacks problem. Int. Trans. Oper. Res. 23(1-2): 25-46 (2016) - [j105]Daniele Ferone, Paola Festa, Mauricio G. C. Resende:
Hybridizations of GRASP with path relinking for the far from most string problem. Int. Trans. Oper. Res. 23(3): 481-506 (2016) - [j104]Mauro Cardoso Lopes, Carlos Eduardo de Andrade, Thiago Alves de Queiroz, Mauricio G. C. Resende, Flávio Keidi Miyazawa:
Heuristics for a hub location-routing problem. Networks 68(1): 54-90 (2016) - [c34]Mauricio G. C. Resende, Celso C. Ribeiro:
Biased Ranom-Key Genetic Algorithms: An Advanced Tutorial. GECCO (Companion) 2016: 483-514 - [i1]David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. CoRR abs/1611.01210 (2016) - 2015
- [j103]Carlos Eduardo de Andrade, Mauricio G. C. Resende, Weiyi Zhang, Rakesh K. Sinha, Kenneth C. Reichmann, Robert D. Doverspike, Flávio Keidi Miyazawa:
A biased random-key genetic algorithm for wireless backhaul network design. Appl. Soft Comput. 33: 150-169 (2015) - [j102]Efrain Ruiz, Maria Albareda-Sambola, Elena Fernández, Mauricio G. C. Resende:
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem. Comput. Oper. Res. 57: 95-108 (2015) - [j101]Carlos Eduardo de Andrade, Rodrigo Franco Toso, Mauricio G. C. Resende, Flávio Keidi Miyazawa:
Biased Random-Key Genetic Algorithms for the Winner Determination Problem in Combinatorial Auctions. Evol. Comput. 23(2): 279-307 (2015) - [j100]Rafael Martí, Vicente Campos, Mauricio G. C. Resende, Abraham Duarte:
Multiobjective GRASP with Path Relinking. Eur. J. Oper. Res. 240(1): 54-71 (2015) - [j99]José Fernando Gonçalves, Mauricio G. C. Resende:
A biased random-key genetic algorithm for the unequal area facility layout problem. Eur. J. Oper. Res. 246(1): 86-107 (2015) - [j98]Abraham Duarte, Jesús Sánchez-Oro, Mauricio G. C. Resende, Fred W. Glover, Rafael Martí:
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization. Inf. Sci. 296: 46-60 (2015) - [j97]Julliany S. Brandão, Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro:
A biased random-key genetic algorithm for single-round divisible load scheduling. Int. Trans. Oper. Res. 22(5): 823-839 (2015) - [j96]Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos:
A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm. J. Comb. Optim. 30(3): 710-728 (2015) - [j95]Rodrigo F. Toso, Mauricio G. C. Resende:
A C++application programming interface for biased random-key genetic algorithms. Optim. Methods Softw. 30(1): 81-93 (2015) - [c33]Fernando Stefanello, Vaneet Aggarwal, Luciana Salete Buriol, José Fernando Gonçalves, Mauricio G. C. Resende:
A Biased Random-key Genetic Algorithm for Placement of Virtual Machines across Geo-Separated Data Centers. GECCO 2015: 919-926 - 2014
- [j94]Luis F. Morán-Mirabal, José Luis González Velarde, Mauricio G. C. Resende:
Randomized heuristics for the family traveling salesperson problem. Int. Trans. Oper. Res. 21(1): 41-57 (2014) - [j93]José Fernando Gonçalves, Mauricio G. C. Resende:
An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling. Int. Trans. Oper. Res. 21(2): 215-246 (2014) - [j92]Abraham Duarte, Rafael Martí, Mauricio G. C. Resende, Ricardo M. A. Silva:
Improved heuristics for the regenerator location problem. Int. Trans. Oper. Res. 21(4): 541-558 (2014) - [j91]Sergiy Butenko, Ding-Zhu Du, Mauricio G. C. Resende:
Preface. J. Comb. Optim. 28(1): 1-2 (2014) - [j90]Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos:
Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm. J. Glob. Optim. 60(2): 289-306 (2014) - [j89]Ricardo M. A. Silva, Diego M. Silva, Mauricio G. C. Resende, Geraldo R. Mateus, José Fernando Gonçalves, Paola Festa:
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. Optim. Lett. 8(4): 1225-1243 (2014) - [c32]Carlos Eduardo de Andrade, Mauricio G. C. Resende, Howard J. Karloff, Flávio Keidi Miyazawa:
Evolutionary algorithms for overlapping correlation clustering. GECCO 2014: 405-412 - [c31]Ricardo M. A. Silva, Mauricio G. C. Resende, Paola Festa, Filipe L. Valentim, Francisco Nascimento Junior:
GRASP with Path-Relinking for the Maximum Contact Map Overlap Problem. LION 2014: 223-226 - [e3]Panos M. Pardalos, Mauricio G. C. Resende, Chrysafis Vogiatzis, Jose L. Walteros:
Learning and Intelligent Optimization - 8th International Conference, Lion 8, Gainesville, FL, USA, February 16-21, 2014. Revised Selected Papers. Lecture Notes in Computer Science 8426, Springer 2014, ISBN 978-3-319-09583-7 [contents] - 2013
- [j88]Chathurika Ranaweera, Mauricio G. C. Resende, Kenneth Reichmann, Patrick Iannone, Paul Henry, Byoung-Jo J. Kim, Peter D. Magill, Kostas N. Oikonomou, Rakesh K. Sinha, Sheryl L. Woodward:
Design and optimization of fiber optic small-cell backhaul based on an existing fiber-to-the-node residential access network. IEEE Commun. Mag. 51(9) (2013) - [j87]Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro:
Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications. Comput. Oper. Res. 40(12): 3080 (2013) - [j86]Luciana S. Pessoa, Mauricio G. C. Resende, Celso C. Ribeiro:
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering. Comput. Oper. Res. 40(12): 3132-3146 (2013) - [j85]Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro:
Multi-start methods for combinatorial optimization. Eur. J. Oper. Res. 226(1): 1-8 (2013) - [j84]Luis F. Morán-Mirabal, José Luis González Velarde, Mauricio G. C. Resende, Ricardo M. A. Silva:
Randomized heuristics for handover minimization in mobility networks. J. Heuristics 19(6): 845-880 (2013) - [j83]Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos, Michael J. Hirsch:
A Python/C library for bound-constrained global optimization with continuous GRASP. Optim. Lett. 7(5): 967-984 (2013) - [c30]Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos, Joao L. Faco:
Biased random-key genetic algorithm for nonlinearly-constrained global optimization. IEEE Congress on Evolutionary Computation 2013: 2201-2206 - [c29]Ricardo Martins Abreu e Silva, Mauricio G. C. Resende, Panos M. Pardalos, Joao L. Faco:
Biased random-key genetic algorithm for linearly-constrained global optimization. GECCO (Companion) 2013: 79-80 - [c28]Carlos Eduardo de Andrade, Flávio Keidi Miyazawa, Mauricio G. C. Resende:
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem. GECCO 2013: 463-470 - [c27]Luis F. Morán-Mirabal, José Luis González Velarde, Mauricio G. C. Resende:
Automatic Tuning of GRASP with Evolutionary Path-Relinking. Hybrid Metaheuristics 2013: 62-77 - [c26]Daniele Ferone, Paola Festa, Mauricio G. C. Resende:
Hybrid Metaheuristics for the Far From Most String Problem. Hybrid Metaheuristics 2013: 174-188 - [c25]Patrick Iannone, Kenneth C. Reichmann, Chathurika Ranaweera, Mauricio G. C. Resende:
A small cell augmentation to a wireless network leveraging fiber-to-the-node access infrastructure for backhaul and power. OFC/NFOEC 2013: 1-3 - [p6]Paola Festa, Mauricio G. C. Resende:
Hybridizations of GRASP with Path-Relinking. Hybrid Metaheuristics 2013: 135-155 - 2012
- [j82]Martín Gómez Ravetti, Carlos Riveros, Alexandre Mendes, Mauricio G. C. Resende, Panos M. Pardalos:
Parallel hybrid heuristics for the permutation flow shop problem. Ann. Oper. Res. 199(1): 269-284 (2012) - [j81]José Fernando Gonçalves, Mauricio G. C. Resende:
A parallel multi-population biased random-key genetic algorithm for a container loading problem. Comput. Oper. Res. 39(2): 179-190 (2012) - [j80]Celso C. Ribeiro, Mauricio G. C. Resende:
Path-relinking intensification methods for stochastic local search algorithms. J. Heuristics 18(2): 193-214 (2012) - [j79]Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck:
Fast local search for the maximum independent set problem. J. Heuristics 18(4): 525-547 (2012) - [j78]Enrique Alba, Mauricio G. C. Resende, María E. Urquhart, Meng-Hiot Lim:
Guest Editorial: Thematic Issue on "Memetic Algorithms: Theory and applications in OR/MS". Memetic Comput. 4(2): 87-88 (2012) - [j77]Mauricio G. C. Resende, Rodrigo F. Toso, José Fernando Gonçalves, Ricardo M. A. Silva:
A biased random-key genetic algorithm for the Steiner triple covering problem. Optim. Lett. 6(4): 605-619 (2012) - 2011
- [j76]José Fernando Gonçalves, Mauricio G. C. Resende, Jorge José de Magalhães Mendes:
A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem. J. Heuristics 17(5): 467-486 (2011) - [j75]José Fernando Gonçalves, Mauricio G. C. Resende:
Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17(5): 487-525 (2011) - [j74]Geraldo R. Mateus, Mauricio G. C. Resende, Ricardo M. A. Silva:
GRASP with path-relinking for the generalized quadratic assignment problem. J. Heuristics 17(5): 527-565 (2011) - [j73]Roger Reis, Marcus Ritt, Luciana S. Buriol, Mauricio G. C. Resende:
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. Int. Trans. Oper. Res. 18(3): 401-423 (2011) - [j72]Michael J. Hirsch, Panos M. Pardalos, Mauricio G. C. Resende:
Correspondence of projected 3-D points and lines using a continuous GRASP. Int. Trans. Oper. Res. 18(4): 493-511 (2011) - [j71]José Fernando Gonçalves, Mauricio G. C. Resende:
A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J. Comb. Optim. 22(2): 180-201 (2011) - [j70]Wanpracha Art Chaovalitwongse, Carlos A. S. Oliveira, Bruno Chiarini, Panos M. Pardalos, Mauricio G. C. Resende:
Revised GRASP with path-relinking for the linear ordering problem. J. Comb. Optim. 22(4): 572-593 (2011) - [j69]Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro:
A biased random-key genetic algorithm for routing and wavelength assignment. J. Glob. Optim. 50(3): 503-518 (2011) - [j68]Abraham Duarte, Rafael Martí, Mauricio G. C. Resende, Ricardo M. A. Silva:
GRASP with path relinking heuristics for the antibandwidth problem. Networks 58(3): 171-189 (2011) - [j67]Luciana S. Pessoa, Mauricio G. C. Resende, Celso C. Ribeiro:
Experiments with LAGRASP heuristic for set k-covering. Optim. Lett. 5(3): 407-419 (2011) - [j66]Mauricio G. C. Resende, Celso C. Ribeiro:
Restart strategies for GRASP with path-relinking heuristics. Optim. Lett. 5(3): 467-478 (2011) - [j65]Paola Festa, Mauricio G. C. Resende:
GRASP: basic components and enhancements. Telecommun. Syst. 46(3): 253-271 (2011) - [c24]Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Disjoint-Path Facility Location: Theory and Practice. ALENEX 2011: 60-74 - [c23]Rafael M. D. Frinhani, Ricardo M. A. Silva, Geraldo R. Mateus, Paola Festa, Mauricio G. C. Resende:
GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data. SEA 2011: 410-420 - [c22]Diego M. Silva, Ricardo M. A. Silva, Geraldo R. Mateus, José Fernando Gonçalves, Mauricio G. C. Resende, Paola Festa:
An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem. SEA 2011: 421-433 - [c21]Cristian A. Martínez, Irene Loiseau, Mauricio G. C. Resende, Silvia Luz Rodríguez:
BRKGA Algorithm for the Capacitated Arc Routing Problem. CLEI Selected Papers 2011: 69-83 - 2010
- [j64]Mauricio G. C. Resende, Rafael Martí, Micael Gallego, Abraham Duarte:
GRASP and path relinking for the max-min diversity problem. Comput. Oper. Res. 37(3): 498-508 (2010) - [j63]Mariá Cristina Vasconcelos Nascimento, Mauricio G. C. Resende, Franklina Maria Bragion Toledo:
GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem. Eur. J. Oper. Res. 200(3): 747-754 (2010) - [j62]Michael J. Hirsch, Panos M. Pardalos, Mauricio G. C. Resende:
Speeding up continuous GRASP. Eur. J. Oper. Res. 205(3): 507-521 (2010) - [j61]Margarida Fonseca, José Rui Figueira, Mauricio G. C. Resende:
Solving scalarized multi-objective network flow problems using an interior point method. Int. Trans. Oper. Res. 17(5): 607-636 (2010) - [j60]Ernesto G. Birgin, Erico M. Gozzi, Mauricio G. C. Resende, Ricardo M. A. Silva:
Continuous GRASP with a local active-set method for bound-constrained global optimization. J. Glob. Optim. 48(2): 289-310 (2010) - [j59]Luciana S. Buriol, Michael J. Hirsch, Panos M. Pardalos, Tania Querido, Mauricio G. C. Resende, Marcus Ritt:
A biased random-key genetic algorithm for road congestion minimization. Optim. Lett. 4(4): 619-633 (2010) - [c20]Paola Festa, José Fernando Gonçalves, Mauricio G. C. Resende, Ricardo M. A. Silva:
Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm. SEA 2010: 338-349
2000 – 2009
- 2009
- [j58]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. Comput. Oper. Res. 36(1): 92-109 (2009) - [j57]Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende:
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. Discret. Appl. Math. 157(6): 1198-1217 (2009) - [j56]Paola Festa, Mauricio G. C. Resende:
An annotated bibliography of GRASP - Part I: Algorithms. Int. Trans. Oper. Res. 16(1): 1-24 (2009) - [j55]Paola Festa, Mauricio G. C. Resende:
An annotated bibliography of GRASP-Part II: Applications. Int. Trans. Oper. Res. 16(2): 131-172 (2009) - [p5]Paola Festa, Mauricio G. C. Resende:
Hybrid GRASP Heuristics. Foundations of Computational Intelligence (3) 2009: 75-100 - [r3]Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende:
Feedback Set Problems. Encyclopedia of Optimization 2009: 1005-1016 - [r2]Mauricio G. C. Resende, Celso C. Ribeiro:
Graph Planarization. Encyclopedia of Optimization 2009: 1448-1453 - [r1]Mauricio G. C. Resende:
Greedy Randomized Adaptive Search Procedures. Encyclopedia of Optimization 2009: 1460-1469 - 2008
- [j54]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. Eur. J. Oper. Res. 189(3): 1171-1190 (2008) - [j53]Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup:
Speeding Up Dynamic Shortest-Path Algorithms. INFORMS J. Comput. 20(2): 191-204 (2008) - [c19]Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro:
Efficient Implementations of Heuristics for Routing and Wavelength Assignment. WEA 2008: 169-180 - [c18]Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck:
Fast Local Search for the Maximum Independent Set Problem. WEA 2008: 220-234 - 2007
- [j52]Mauricio G. C. Resende, Renato Fonseca F. Werneck:
A fast swap-based local search procedure for location problems. Ann. Oper. Res. 150(1): 205-230 (2007) - [j51]Carlos A. S. Oliveira, Panos M. Pardalos, Oleg A. Prokopyev, Mauricio G. C. Resende:
Streaming cache placement problems: complexity and algorithms. Int. J. Comput. Sci. Eng. 3(3): 173-183 (2007) - [j50]Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup:
Survivable IP network design with OSPF routing. Networks 49(1): 51-64 (2007) - [j49]Michael J. Hirsch, Cláudio Nogueira de Meneses, Panos M. Pardalos, Mauricio G. C. Resende:
Global optimization by continuous grasp. Optim. Lett. 1(2): 201-212 (2007) - [j48]Renata M. Aiex, Mauricio G. C. Resende, Celso C. Ribeiro:
TTT plots: a perl program to create time-to-target plots. Optim. Lett. 1(4): 355-366 (2007) - [j47]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) - 2006
- [j46]Mauricio G. C. Resende, Renato Fonseca F. Werneck:
A hybrid multistart heuristic for the uncapacitated facility location problem. Eur. J. Oper. Res. 174(1): 54-68 (2006) - [j45]Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende:
GRASP with path relinking for the weighted MAXSAT problem. ACM J. Exp. Algorithmics 11 (2006) - [p4]Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio G. C. Resende:
Optimization Problems in Multicast Tree Construction. Handbook of Optimization in Telecommunications 2006: 701-731 - [e2]Mauricio G. C. Resende, Panos M. Pardalos:
Handbook of Optimization in Telecommunications. Springer 2006, ISBN 978-0-387-30662-9 [contents] - 2005
- [j44]José Fernando Gonçalves, Jorge José de Magalhães Mendes, Mauricio G. C. Resende:
A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. 167(1): 77-95 (2005) - [j43]Renata M. Aiex, Mauricio G. C. Resende, Panos M. Pardalos, Gerardo Toraldo:
GRASP with Path Relinking for Three-Index Assignment. INFORMS J. Comput. 17(2): 224-247 (2005) - [j42]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) - [c17]Renata Teixeira, Timothy G. Griffin, Mauricio G. C. Resende, Jennifer Rexford:
TIE breaking: tunable interdomain egress selection. CoNEXT 2005: 93-104 - [c16]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 - 2004
- [j41]José Fernando Gonçalves, Mauricio G. C. Resende:
An evolutionary algorithm for manufacturing cell formation. Comput. Ind. Eng. 47(2-3): 247-273 (2004) - [j40]Abilio Lucena, Mauricio G. C. Resende:
Strong lower bounds for the prize collecting Steiner problem in graphs. Discret. Appl. Math. 141(1-3): 277-294 (2004) - [j39]Mauricio G. C. Resende, Renato Fonseca F. Werneck:
A Hybrid Heuristic for the p-Median Problem. J. Heuristics 10(1): 59-88 (2004) - [c15]Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio G. C. Resende:
GRASP with Path-Relinking for the Quadratic Assignment Problem. WEA 2004: 356-368 - 2003
- [j38]Mauricio G. C. Resende, José Luis González Velarde:
GRASP: Procedimientos de búsquedas miopes aleatorizados y adaptativos. Inteligencia Artif. 7(19): 61-76 (2003) - [j37]Joaquim João Júdice, João Patrício, Luis F. Portugal, Mauricio G. C. Resende, Geraldo Veiga:
A Study of Preconditioners for Network Interior Point Methods. Comput. Optim. Appl. 24(1): 5-35 (2003) - [j36]Mauricio G. C. Resende, Celso C. Ribeiro:
A GRASP with path-relinking for private virtual circuit routing. Networks 41(2): 104-114 (2003) - [j35]Mauricio G. C. Resende, Geraldo Veiga:
An annotated bibliography of network interior point methods. Networks 42(2): 114-121 (2003) - [j34]Renata M. Aiex, S. Binato, Mauricio G. C. Resende:
Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput. 29(4): 393-430 (2003) - [c14]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 - [p3]Mauricio G. C. Resende, Celso C. Ribeiro:
Greedy Randomized Adaptive Search Procedures. Handbook of Metaheuristics 2003: 219-249 - 2002
- [j33]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) - [j32]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) - [j31]Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro:
Randomized heuristics for the Max-Cut problem. Optim. Methods Softw. 17(6): 1033-1058 (2002) - [c13]James Abello, Mauricio G. C. Resende, Sandra Sudarsky:
Massive Quasi-Clique Detection. LATIN 2002: 598-612 - 2001
- [j30]Marcelo C. Medeiros, Mauricio G. C. Resende, Álvaro Veiga:
Piecewise Linear Time Series Estimation with GRASP. Comput. Optim. Appl. 19(2): 127-144 (2001) - [j29]Abilio Lucena, Mauricio G. C. Resende:
Generating lower bounds for the prize collecting Steiner problem in graphs. Electron. Notes Discret. Math. 7: 70-73 (2001) - [j28]Mauricio G. C. Resende:
"Mobile Networks and Computing". J. Comb. Optim. 5(4): 297-298 (2001) - [j27]Mauricio G. C. Resende:
Multichannel Optical Networks: Theory and Practice. J. Comb. Optim. 5(4): 495-496 (2001) - [j26]James Abello, Sergiy Butenko, Panos M. Pardalos, Mauricio G. C. Resende:
Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Glob. Optim. 21(2): 111-137 (2001) - [j25]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) - [j24]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) - [c12]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 - 2000
- [j23]Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos:
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. Discret. Appl. Math. 100(1-2): 95-113 (2000) - [j22]Simone L. Martins, Mauricio G. C. Resende, Celso C. Ribeiro, Panos M. Pardalos:
A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy. J. Glob. Optim. 17(1-4): 267-283 (2000) - [j21]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) - [c11]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
1990 – 1999
- 1999
- [j20]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) - [c10]Xin Liu, Panos M. Pardalos, Sanguthevar Rajasekaran, Mauricio G. C. Resende:
A GRASP for frequency assignment in mobile radio networks. Mobile Networks and Computing 1999: 195-201 - [p2]Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende:
Feedback Set Problems. Handbook of Combinatorial Optimization 1999: 209-258 - [p1]Robert A. Murphey, Panos M. Pardalos, Mauricio G. C. Resende:
Frequency Assignment Problems. Handbook of Combinatorial Optimization 1999: 295-377 - 1998
- [j19]Thelma D. Mavridou, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende:
A GRASP for the biquadratic assignment problem. Eur. J. Oper. Res. 105(3): 613-621 (1998) - [j18]Mauricio G. C. Resende:
Computing Approximate Solutions of the Maximum Covering Problem with GRASP. J. Heuristics 4(2): 161-177 (1998) - [j17]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) - [j16]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) - [c9]James Abello, Panos M. Pardalos, Mauricio G. C. Resende:
On maximum clique problems in very large graphs. External Memory Algorithms 1998: 119-130 - 1997
- [j15]Mauricio G. C. Resende, Celso C. Ribeiro:
A GRASP for graph planarization. Networks 29(3): 173-189 (1997) - [j14]Panos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende, Yong Li:
Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem. SIAM J. Optim. 7(1): 280-294 (1997) - [j13]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) - [c8]Simone L. Martins, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro:
Greedy randomized adaptive search procedures for the Steiner problem in graphs. Randomization Methods in Algorithm Design 1997: 133-145 - 1996
- [j12]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) - [c7]Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos:
Approximate solution of weighted MAX-SAT problems using GRASP. Satisfiability Problem: Theory and Applications 1996: 393-405 - [c6]Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende:
A Parallel GRASP for MAX-SAT Problems. PARA 1996: 575-585 - 1995
- [j11]Richard S. Barr, Bruce L. Golden, James P. Kelly, Mauricio G. C. Resende, William R. Stewart:
Designing and reporting on computational experiments with heuristic methods. J. Heuristics 1(1): 9-32 (1995) - [j10]Mauricio G. C. Resende, K. G. Ramakrishnan, Zvi Drezner:
Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming. Oper. Res. 43(5): 781-791 (1995) - [j9]Thomas A. Feo, Mauricio G. C. Resende:
Greedy Randomized Adaptive Search Procedures. J. Glob. Optim. 6(2): 109-133 (1995) - [c5]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 - [e1]Panos M. Pardalos, Mauricio G. C. Resende, K. G. Ramakrishnan:
Workshop on Parallel Processing of Discrete Optimization Problems, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, April 28-29, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 22, DIMACS/AMS 1995, ISBN 978-0-8218-0240-3 [contents] - 1994
- [j8]Yong Li, Panos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende:
Lower bounds for the quadratic assignment problem. Ann. Oper. Res. 50(1): 387-410 (1994) - [j7]Thomas A. Feo, Mauricio G. C. Resende, Stuart H. Smith:
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Oper. Res. 42(5): 860-878 (1994) - 1993
- [j6]Mauricio G. C. Resende, Geraldo Veiga:
An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks. SIAM J. Optim. 3(3): 516-537 (1993) - [c4]Yong Li, Panos M. Pardalos, Mauricio G. C. Resende:
A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem. Quadratic Assignment and Related Problems 1993: 237-261 - [c3]Mauricio G. C. Resende, Thomas A. Feo:
A GRASP for satisfiability. Cliques, Coloring, and Satisfiability 1993: 499-520 - 1992
- [j5]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
- [j4]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) - [c2]Mauricio G. C. Resende, Geraldo Veiga:
An Efficient Implementation of a Network Interior Point Method. Network Flows And Matching 1991: 299-348 - 1990
- [j3]Renato D. C. Monteiro, Ilan Adler, Mauricio G. C. Resende:
A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension. Math. Oper. Res. 15(2): 191-214 (1990) - [c1]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
1980 – 1989
- 1989
- [j2]Ilan Adler, Narendra Karmarkar, Mauricio G. C. Resende, Geraldo Veiga:
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm. INFORMS J. Comput. 1(2): 84-106 (1989) - [j1]Ilan Adler, Mauricio G. C. Resende, Geraldo Veiga, Narendra Karmarkar:
An implementation of Karmarkar's algorithm for linear programming. Math. Program. 44(1-3): 297-335 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
