Mauricio G. C. Resende

202 papers A 7B 7Journal 146Unranked 26

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Applying a Random-Key Optimizer on Mixed Integer Programs. CoRR Antonio Augusto Chaves, Mauricio G. C. Resende, Carise E. Schmidt, John Kyle Brubaker, Helmut G. Katzgraber
2026	J	`jnl`	Metaheuristic algorithms for the induced p-median problem with upgrades. Knowl. Based Syst. Sérgio Salazar, Abraham Duarte, Mauricio G. C. Resende, J. Manuel Colmenar
2025	J	`jnl`	A Random-Key optimizer for combinatorial optimization. J. Heuristics Antonio Augusto Chaves, Mauricio G. C. Resende, Martin J. A. Schuetz, John Kyle Brubaker, Helmut G. Katzgraber, Edilson Fernandes de Arruda, Ricardo M. A. Silva
2025	J	`jnl`	A metaheuristic algorithm for large maximum weight independent set problems. Networks Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2025	J	`jnl`	Biased random-key genetic algorithms: A review. Eur. J. Oper. Res. Mariana A. Londe, Luciana S. Pessoa, Carlos Eduardo de Andrade, Mauricio G. C. Resende
2025	J	`jnl`	Greedy Randomized Adaptive Search Procedures with Path Relinking. An analytical review of designs and implementations. Eur. J. Oper. Res. Manuel Laguna, Rafael Martí, Anna Martínez-Gavara, Sergio Pérez-Peló, Mauricio G. C. Resende
2025	J	`jnl`	Preface to the Special Issue on Metaheuristics: Recent Advances and Applications. Int. Trans. Oper. Res. Paola Festa, Luca Di Gaspero, Mario Pavone, Mauricio G. C. Resende
2025	J	`jnl`	Random-key genetic algorithms: Principles and applications. CoRR Mariana A. Londe, Luciana S. Pessoa, Carlos Eduardo de Andrade, José Fernando Gonçalves, Mauricio G. C. Resende
2025	J	`jnl`	The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm. Comput. Oper. Res. Mateus C. Silva, Rafael A. Melo, Mauricio G. C. Resende, Marcio Costa Santos, Rodrigo F. Toso
2025	J	`jnl`	Two-phase GRASP for the Multi-Constraint Graph Partitioning problem. Comput. Oper. Res. Alberto Herrán, J. Manuel Colmenar, Mauricio G. C. Resende
2024	—	`conf`	A Continuous-GRASP Random-Key Optimizer. MIC (1) Antonio Augusto Chaves, Mauricio G. C. Resende, Ricardo M. A. Silva
2024	J	`jnl`	A Random-Key Optimizer for Combinatorial Optimization. CoRR Antonio Augusto Chaves, Mauricio G. C. Resende, Martin J. A. Schuetz, John Kyle Brubaker, Helmut G. Katzgraber, Edilson Fernandes de Arruda, Ricardo M. A. Silva
2024	J	`jnl`	A biased random-key genetic algorithm for the home health care problem. Int. Trans. Oper. Res. Alberto Francisco Kummer Neto, Olinto C. B. de Araújo, Luciana S. Buriol, Mauricio G. C. Resende
2024	J	`jnl`	A biased random-key genetic algorithm with variable mutants to solve a vehicle routing problem. CoRR Paola Festa, Francesca Guerriero, Mauricio G. C. Resende, Edoardo Scalzo
2024	J	`jnl`	A random-key GRASP for combinatorial optimization. CoRR Antonio Augusto Chaves, Mauricio G. C. Resende, Ricardo M. A. Silva
2024	J	`jnl`	Amazon Locker Capacity Management. INFORMS J. Appl. Anal. Samyukta Sethuraman, Ankur Bansal, Setareh Mardan, Mauricio G. C. Resende, Timothy L. Jacobs
2024	J	`jnl`	Early years of Biased Random-Key Genetic Algorithms: A systematic review. CoRR Mariana A. Londe, Luciana S. Pessoa, Carlos E. Andrade, Mauricio G. C. Resende
2024	J	`jnl`	Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be? Comput. Oper. Res. Mateus C. Silva, Rafael A. Melo, Mauricio G. C. Resende, Marcio Costa Santos, Rodrigo F. Toso
2024	J	`jnl`	The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm. CoRR Mateus C. Silva, Rafael A. Melo, Mauricio G. C. Resende, Marcio Costa Santos, Rodrigo F. Toso
2023	J	`jnl`	Amazon Locker Capacity Management. CoRR Samyukta Sethuraman, Ankur Bansal, Setareh Mardan, Mauricio G. C. Resende, Timothy L. Jacobs
2023	J	`jnl`	Biased Random-Key Genetic Algorithms: A Review. CoRR Mariana A. Londe, Luciana S. Pessoa, Carlos Eduardo de Andrade, Mauricio G. C. Resende
2023	J	`jnl`	Efficient GRASP solution approach for the Prisoner Transportation Problem. Comput. Oper. Res. Daniele Ferone, Paola Festa, Tommaso Pastore, Mauricio G. C. Resende
2023	B	`conf`	cudaBRKGA-CNN: An Approach for Optimizing Convolutional Neural Network Architectures. CEC Andersson A. Da Silva, Ricardo M. A. Silva, Amanda S. Xavier, Thiago Dias Bispo, Geraldo R. Mateus, Mauricio G. C. Resende
2022	—	`conf`	A BRKGA with Implicit Path-Relinking for the Vehicle Routing Problem with Occasional Drivers and Time Windows. MIC Paola Festa, Francesca Guerriero, Mauricio G. C. Resende, Edoardo Scalzo
2022	J	`jnl`	A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation. Optim. Methods Softw. Beatriz Brito Oliveira, Maria Antónia Carravilla, José Fernando Oliveira, Mauricio G. C. Resende
2022	A	`conf`	A Local Search Algorithm for Large Maximum Weight Independent Set Problems. ESA Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2022	J	`jnl`	A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems. CoRR Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2022	J	`jnl`	A biased random-key genetic algorithm for the home health care problem. CoRR Alberto Francisco Kummer Neto, Olinto C. B. de Araújo, Luciana S. Buriol, Mauricio G. C. Resende
2022	J	`jnl`	Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems. J. Comb. Optim. Dalila B. M. M. Fontes, Seyed Mahdi Homayouni, Mauricio G. C. Resende
2022	J	`jnl`	Optimization of Robot Trajectory Planning with Nature-Inspired and Hybrid Quantum Algorithms. CoRR 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
2021	J	`jnl`	A light-touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique. Int. Trans. Oper. Res. 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
2021	J	`jnl`	New Instances for Maximum Weight Independent Set From a Vehicle Routing Application. Oper. Res. Forum Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2021	J	`jnl`	New instances for maximum weight independent set from a vehicle routing application. CoRR Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen
2021	J	`jnl`	The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications. Eur. J. Oper. Res. Carlos Eduardo de Andrade, Rodrigo F. Toso, José Fernando Gonçalves, Mauricio G. C. Resende
2020	J	`jnl`	Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. Oper. Res. David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen
2019	J	`jnl`	Hybrid algorithms for placement of virtual machines across geo-separated data centers. J. Comb. Optim. Fernando Stefanello, Vaneet Aggarwal, Luciana S. Buriol, Mauricio G. C. Resende
2018	—	`ch.`	Biased Random-Key Genetic Progamming. Handbook of Heuristics José Fernando Gonçalves, Mauricio G. C. Resende
2018	—	`ch.`	GRASP. Handbook of Heuristics Paola Festa, Mauricio G. C. Resende
2018	—	`book`	Handbook of Heuristics. Rafael Martí, Panos M. Pardalos, Mauricio G. C. Resende
2018	J	`jnl`	Preface: Recent advances in telecommunications networks planning and operation. Networks Bernard Fortz, Dimitri Papadimitriou, Mauricio G. C. Resende
2018	—	`ch.`	Random-Key Genetic Algorithms. Handbook of Heuristics José Fernando Gonçalves, Mauricio G. C. Resende
2017	—	`conf`	A New Local Search for the p-Center Problem Based on the Critical Vertex Concept. LION Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende
2017	J	`jnl`	A biased random key genetic algorithm applied to the electric distribution network reconfiguration problem. J. Heuristics Haroldo de Faria Jr., Mauricio G. C. Resende, Damien Ernst
2017	J	`jnl`	A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems. Int. Trans. Oper. Res. Julliany S. Brandão, Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro
2017	J	`jnl`	A biased random-key genetic algorithm for the tree of hubs location problem. Optim. Lett. Luciana S. Pessoa, Andréa C. Santos, Mauricio G. C. Resende
2017	—	`conf`	On the fast solution of the p-center problem. ICTON Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende
2017	J	`jnl`	On the minimization of traffic congestion in road networks with tolls. Ann. Oper. Res. Fernando Stefanello, Luciana S. Buriol, Michael J. Hirsch, Panos M. Pardalos, Tania Querido, Mauricio G. C. Resende, Marcus Ritt
2016	J	`jnl`	A biased random key genetic algorithm for the field technician scheduling problem. Comput. Oper. Res. Ricardo B. Damm, Mauricio G. C. Resende, Débora P. Ronconi
2016	J	`jnl`	A biased random-key genetic algorithm for the minimization of open stacks problem. Int. Trans. Oper. Res. José Fernando Gonçalves, Mauricio G. C. Resende, Miguel Dias Costa
2016	—	`conf`	Biased Ranom-Key Genetic Algorithms: An Advanced Tutorial. GECCO (Companion) Mauricio G. C. Resende, Celso C. Ribeiro
2016	J	`jnl`	Heuristics for a hub location-routing problem. Networks Mauro Cardoso Lopes, Carlos Eduardo de Andrade, Thiago Alves de Queiroz, Mauricio G. C. Resende, Flávio Keidi Miyazawa
2016	J	`jnl`	Hybrid method with CS and BRKGA applied to the minimization of tool switches problem. Comput. Oper. Res. Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena, Edson Luiz França Senne, Mauricio G. C. Resende
2016	J	`jnl`	Hybridizations of GRASP with path relinking for the far from most string problem. Int. Trans. Oper. Res. Daniele Ferone, Paola Festa, Mauricio G. C. Resende
2016	J	`jnl`	Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. CoRR David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen
2015	A	`conf`	A Biased Random-key Genetic Algorithm for Placement of Virtual Machines across Geo-Separated Data Centers. GECCO Fernando Stefanello, Vaneet Aggarwal, Luciana Salete Buriol, José Fernando Gonçalves, Mauricio G. C. Resende
2015	J	`jnl`	A C++application programming interface for biased random-key genetic algorithms. Optim. Methods Softw. Rodrigo F. Toso, Mauricio G. C. Resende
2015	J	`jnl`	A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm. J. Comb. Optim. Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos
2015	J	`jnl`	A biased random-key genetic algorithm for single-round divisible load scheduling. Int. Trans. Oper. Res. Julliany S. Brandão, Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro
2015	J	`jnl`	A biased random-key genetic algorithm for the capacitated minimum spanning tree problem. Comput. Oper. Res. Efrain Ruiz, Maria Albareda-Sambola, Elena Fernández, Mauricio G. C. Resende
2015	J	`jnl`	A biased random-key genetic algorithm for the unequal area facility layout problem. Eur. J. Oper. Res. José Fernando Gonçalves, Mauricio G. C. Resende
2015	J	`jnl`	A biased random-key genetic algorithm for wireless backhaul network design. Appl. Soft Comput. Carlos Eduardo de Andrade, Mauricio G. C. Resende, Weiyi Zhang, Rakesh K. Sinha, Kenneth C. Reichmann, Robert D. Doverspike, Flávio Keidi Miyazawa
2015	J	`jnl`	Biased Random-Key Genetic Algorithms for the Winner Determination Problem in Combinatorial Auctions. Evol. Comput. Carlos Eduardo de Andrade, Rodrigo Franco Toso, Mauricio G. C. Resende, Flávio Keidi Miyazawa
2015	J	`jnl`	Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization. Inf. Sci. Abraham Duarte, Jesús Sánchez-Oro, Mauricio G. C. Resende, Fred W. Glover, Rafael Martí
2015	J	`jnl`	Multiobjective GRASP with Path Relinking. Eur. J. Oper. Res. Rafael Martí, Vicente Campos, Mauricio G. C. Resende, Abraham Duarte
2014	J	`jnl`	An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. Optim. Lett. Ricardo M. A. Silva, Diego M. Silva, Mauricio G. C. Resende, Geraldo R. Mateus, José Fernando Gonçalves, Paola Festa
2014	J	`jnl`	An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling. Int. Trans. Oper. Res. José Fernando Gonçalves, Mauricio G. C. Resende
2014	A	`conf`	Evolutionary algorithms for overlapping correlation clustering. GECCO Carlos Eduardo de Andrade, Mauricio G. C. Resende, Howard J. Karloff, Flávio Keidi Miyazawa
2014	J	`jnl`	Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm. J. Glob. Optim. Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos
2014	—	`conf`	GRASP with Path-Relinking for the Maximum Contact Map Overlap Problem. LION Ricardo M. A. Silva, Mauricio G. C. Resende, Paola Festa, Filipe L. Valentim, Francisco Nascimento Junior
2014	J	`jnl`	Improved heuristics for the regenerator location problem. Int. Trans. Oper. Res. Abraham Duarte, Rafael Martí, Mauricio G. C. Resende, Ricardo M. A. Silva
2014	—	`ed.`	Learning and Intelligent Optimization - 8th International Conference, Lion 8, Gainesville, FL, USA, February 16-21, 2014. Revised Selected Papers LION Panos M. Pardalos, Mauricio G. C. Resende, Chrysafis Vogiatzis, Jose L. Walteros
2014	J	`jnl`	Preface. J. Comb. Optim. Sergiy Butenko, Ding-Zhu Du, Mauricio G. C. Resende
2014	J	`jnl`	Randomized heuristics for the family traveling salesperson problem. Int. Trans. Oper. Res. Luis F. Morán-Mirabal, José Luis González Velarde, Mauricio G. C. Resende
2013	J	`jnl`	A Python/C library for bound-constrained global optimization with continuous GRASP. Optim. Lett. Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos, Michael J. Hirsch
2013	J	`jnl`	A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering. Comput. Oper. Res. Luciana S. Pessoa, Mauricio G. C. Resende, Celso C. Ribeiro
2013	—	`conf`	A small cell augmentation to a wireless network leveraging fiber-to-the-node access infrastructure for backhaul and power. OFC/NFOEC Patrick Iannone, Kenneth C. Reichmann, Chathurika Ranaweera, Mauricio G. C. Resende
2013	—	`conf`	Automatic Tuning of GRASP with Evolutionary Path-Relinking. Hybrid Metaheuristics Luis F. Morán-Mirabal, José Luis González Velarde, Mauricio G. C. Resende
2013	—	`conf`	Biased random-key genetic algorithm for linearly-constrained global optimization. GECCO (Companion) Ricardo Martins Abreu e Silva, Mauricio G. C. Resende, Panos M. Pardalos, Joao L. Faco
2013	B	`conf`	Biased random-key genetic algorithm for nonlinearly-constrained global optimization. IEEE Congress on Evolutionary Computation Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos, Joao L. Faco
2013	J	`jnl`	Design and optimization of fiber optic small-cell backhaul based on an existing fiber-to-the-node residential access network. IEEE Commun. Mag. 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
2013	A	`conf`	Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem. GECCO Carlos Eduardo de Andrade, Flávio Keidi Miyazawa, Mauricio G. C. Resende
2013	—	`conf`	Hybrid Metaheuristics for the Far From Most String Problem. Hybrid Metaheuristics Daniele Ferone, Paola Festa, Mauricio G. C. Resende
2013	—	`ch.`	Hybridizations of GRASP with Path-Relinking. Hybrid Metaheuristics Paola Festa, Mauricio G. C. Resende
2013	J	`jnl`	Multi-start methods for combinatorial optimization. Eur. J. Oper. Res. Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro
2013	J	`jnl`	Randomized heuristics for handover minimization in mobility networks. J. Heuristics Luis F. Morán-Mirabal, José Luis González Velarde, Mauricio G. C. Resende, Ricardo M. A. Silva
2013	J	`jnl`	Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications. Comput. Oper. Res. Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro
2012	J	`jnl`	A biased random-key genetic algorithm for the Steiner triple covering problem. Optim. Lett. Mauricio G. C. Resende, Rodrigo F. Toso, José Fernando Gonçalves, Ricardo M. A. Silva
2012	J	`jnl`	A parallel multi-population biased random-key genetic algorithm for a container loading problem. Comput. Oper. Res. José Fernando Gonçalves, Mauricio G. C. Resende
2012	J	`jnl`	Fast local search for the maximum independent set problem. J. Heuristics Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck
2012	J	`jnl`	Guest Editorial: Thematic Issue on "Memetic Algorithms: Theory and applications in OR/MS". Memetic Comput. Enrique Alba, Mauricio G. C. Resende, María E. Urquhart, Meng-Hiot Lim
2012	J	`jnl`	Parallel hybrid heuristics for the permutation flow shop problem. Ann. Oper. Res. Martín Gómez Ravetti, Carlos Riveros, Alexandre Mendes, Mauricio G. C. Resende, Panos M. Pardalos
2012	J	`jnl`	Path-relinking intensification methods for stochastic local search algorithms. J. Heuristics Celso C. Ribeiro, Mauricio G. C. Resende
2011	J	`jnl`	A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. Int. Trans. Oper. Res. Roger Reis, Marcus Ritt, Luciana S. Buriol, Mauricio G. C. Resende
2011	J	`jnl`	A biased random-key genetic algorithm for routing and wavelength assignment. J. Glob. Optim. Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro
2011	J	`jnl`	A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem. J. Heuristics José Fernando Gonçalves, Mauricio G. C. Resende, Jorge José de Magalhães Mendes
2011	J	`jnl`	A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J. Comb. Optim. José Fernando Gonçalves, Mauricio G. C. Resende
2011	B	`conf`	An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem. SEA Diego M. Silva, Ricardo M. A. Silva, Geraldo R. Mateus, José Fernando Gonçalves, Mauricio G. C. Resende, Paola Festa
2011	—	`conf`	BRKGA Algorithm for the Capacitated Arc Routing Problem. CLEI Selected Papers Cristian A. Martínez, Irene Loiseau, Mauricio G. C. Resende, Silvia Luz Rodríguez
2011	J	`jnl`	Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics José Fernando Gonçalves, Mauricio G. C. Resende
2011	J	`jnl`	Correspondence of projected 3-D points and lines using a continuous GRASP. Int. Trans. Oper. Res. Michael J. Hirsch, Panos M. Pardalos, Mauricio G. C. Resende
2011	A	`conf`	Disjoint-Path Facility Location: Theory and Practice. ALENEX Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen
2011	J	`jnl`	Experiments with LAGRASP heuristic for set Optim. Lett. Luciana S. Pessoa, Mauricio G. C. Resende, Celso C. Ribeiro
2011	B	`conf`	GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data. SEA Rafael M. D. Frinhani, Ricardo M. A. Silva, Geraldo R. Mateus, Paola Festa, Mauricio G. C. Resende
2011	J	`jnl`	GRASP with path relinking heuristics for the antibandwidth problem. Networks Abraham Duarte, Rafael Martí, Mauricio G. C. Resende, Ricardo M. A. Silva
2011	J	`jnl`	GRASP with path-relinking for the generalized quadratic assignment problem. J. Heuristics Geraldo R. Mateus, Mauricio G. C. Resende, Ricardo M. A. Silva
2011	J	`jnl`	GRASP: basic components and enhancements. Telecommun. Syst. Paola Festa, Mauricio G. C. Resende
2011	J	`jnl`	Restart strategies for GRASP with path-relinking heuristics. Optim. Lett. Mauricio G. C. Resende, Celso C. Ribeiro
2011	J	`jnl`	Revised GRASP with path-relinking for the linear ordering problem. J. Comb. Optim. Wanpracha Art Chaovalitwongse, Carlos A. S. Oliveira, Bruno Chiarini, Panos M. Pardalos, Mauricio G. C. Resende
2010	J	`jnl`	A biased random-key genetic algorithm for road congestion minimization. Optim. Lett. Luciana S. Buriol, Michael J. Hirsch, Panos M. Pardalos, Tania Querido, Mauricio G. C. Resende, Marcus Ritt
2010	B	`conf`	Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm. SEA Paola Festa, José Fernando Gonçalves, Mauricio G. C. Resende, Ricardo M. A. Silva
2010	J	`jnl`	Continuous GRASP with a local active-set method for bound-constrained global optimization. J. Glob. Optim. Ernesto G. Birgin, Erico M. Gozzi, Mauricio G. C. Resende, Ricardo M. A. Silva
2010	J	`jnl`	GRASP and path relinking for the max-min diversity problem. Comput. Oper. Res. Mauricio G. C. Resende, Rafael Martí, Micael Gallego, Abraham Duarte
2010	J	`jnl`	GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem. Eur. J. Oper. Res. Mariá Cristina Vasconcelos Nascimento, Mauricio G. C. Resende, Franklina Maria Bragion Toledo
2010	J	`jnl`	Solving scalarized multi-objective network flow problems using an interior point method. Int. Trans. Oper. Res. Margarida Fonseca, José Rui Figueira, Mauricio G. C. Resende
2010	J	`jnl`	Speeding up continuous GRASP. Eur. J. Oper. Res. Michael J. Hirsch, Panos M. Pardalos, Mauricio G. C. Resende
2009	J	`jnl`	A random key based genetic algorithm for the resource constrained project scheduling problem. Comput. Oper. Res. Jorge José de Magalhães Mendes, José Fernando Gonçalves, Mauricio G. C. Resende
2009	J	`jnl`	A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. Discret. Appl. Math. Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende
2009	J	`jnl`	An annotated bibliography of GRASP - Part I: Algorithms. Int. Trans. Oper. Res. Paola Festa, Mauricio G. C. Resende
2009	J	`jnl`	An annotated bibliography of GRASP-Part II: Applications. Int. Trans. Oper. Res. Paola Festa, Mauricio G. C. Resende
2009	—	`ch.`	Feedback Set Problems. Encyclopedia of Optimization Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende
2009	—	`ch.`	Graph Planarization. Encyclopedia of Optimization Mauricio G. C. Resende, Celso C. Ribeiro
2009	—	`ch.`	Greedy Randomized Adaptive Search Procedures. Encyclopedia of Optimization Mauricio G. C. Resende
2009	—	`ch.`	Hybrid GRASP Heuristics. Foundations of Computational Intelligence (3) Paola Festa, Mauricio G. C. Resende
2008	J	`jnl`	A genetic algorithm for the resource constrained multi-project scheduling problem. Eur. J. Oper. Res. José Fernando Gonçalves, Jorge José de Magalhães Mendes, Mauricio G. C. Resende
2008	—	`conf`	Efficient Implementations of Heuristics for Routing and Wavelength Assignment. WEA Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro
2008	—	`conf`	Fast Local Search for the Maximum Independent Set Problem. WEA Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck
2008	J	`jnl`	Speeding Up Dynamic Shortest-Path Algorithms. INFORMS J. Comput. Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup
2007	J	`jnl`	A fast swap-based local search procedure for location problems. Ann. Oper. Res. Mauricio G. C. Resende, Renato Fonseca F. Werneck
2007	J	`jnl`	Global optimization by continuous grasp. Optim. Lett. Michael J. Hirsch, Cláudio Nogueira de Meneses, Panos M. Pardalos, Mauricio G. C. Resende
2007	J	`jnl`	Streaming cache placement problems: complexity and algorithms. Int. J. Comput. Sci. Eng. Carlos A. S. Oliveira, Panos M. Pardalos, Oleg A. Prokopyev, Mauricio G. C. Resende
2007	J	`jnl`	Survivable IP network design with OSPF routing. Networks Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup
2007	J	`jnl`	TIE breaking: tunable interdomain egress selection. IEEE/ACM Trans. Netw. Renata Teixeira, Timothy G. Griffin, Mauricio G. C. Resende, Jennifer Rexford
2007	J	`jnl`	TTT plots: a perl program to create time-to-target plots. Optim. Lett. Renata M. Aiex, Mauricio G. C. Resende, Celso C. Ribeiro
2006	J	`jnl`	A hybrid multistart heuristic for the uncapacitated facility location problem. Eur. J. Oper. Res. Mauricio G. C. Resende, Renato Fonseca F. Werneck
2006	J	`jnl`	GRASP with path relinking for the weighted MAXSAT problem. ACM J. Exp. Algorithmics Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
2006	—	`book`	Handbook of Optimization in Telecommunications Mauricio G. C. Resende, Panos M. Pardalos
2006	—	`ch.`	Optimization Problems in Multicast Tree Construction. Handbook of Optimization in Telecommunications Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio G. C. Resende
2005	J	`jnl`	A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. José Fernando Gonçalves, Jorge José de Magalhães Mendes, Mauricio G. C. Resende
2005	J	`jnl`	A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks Luciana S. Buriol, Mauricio G. C. Resende, Celso C. Ribeiro, Mikkel Thorup
2005	J	`jnl`	GRASP with Path Relinking for Three-Index Assignment. INFORMS J. Comput. Renata M. Aiex, Mauricio G. C. Resende, Panos M. Pardalos, Gerardo Toraldo
2005	—	`conf`	GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem. WEA Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
2005	A	`conf`	TIE breaking: tunable interdomain egress selection. CoNEXT Renata Teixeira, Timothy G. Griffin, Mauricio G. C. Resende, Jennifer Rexford
2004	J	`jnl`	A Hybrid Heuristic for the p-Median Problem. J. Heuristics Mauricio G. C. Resende, Renato Fonseca F. Werneck
2004	J	`jnl`	An evolutionary algorithm for manufacturing cell formation. Comput. Ind. Eng. José Fernando Gonçalves, Mauricio G. C. Resende
2004	—	`conf`	GRASP with Path-Relinking for the Quadratic Assignment Problem. WEA Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio G. C. Resende
2004	J	`jnl`	Strong lower bounds for the prize collecting Steiner problem in graphs. Discret. Appl. Math. Abilio Lucena, Mauricio G. C. Resende
2003	J	`jnl`	A GRASP with path-relinking for private virtual circuit routing. Networks Mauricio G. C. Resende, Celso C. Ribeiro
2003	J	`jnl`	A Study of Preconditioners for Network Interior Point Methods. Comput. Optim. Appl. Joaquim João Júdice, João Patrício, Luis F. Portugal, Mauricio G. C. Resende, Geraldo Veiga
2003	J	`jnl`	An annotated bibliography of network interior point methods. Networks Mauricio G. C. Resende, Geraldo Veiga
2003	J	`jnl`	GRASP: Procedimientos de búsquedas miopes aleatorizados y adaptativos. Inteligencia Artif. Mauricio G. C. Resende, José Luis González Velarde
2003	—	`ch.`	Greedy Randomized Adaptive Search Procedures. Handbook of Metaheuristics Mauricio G. C. Resende, Celso C. Ribeiro
2003	A	`conf`	On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem. ALENEX Mauricio G. C. Resende, Renato Fonseca F. Werneck
2003	J	`jnl`	Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput. Renata M. Aiex, S. Binato, Mauricio G. C. Resende
2002	J	`jnl`	A Genetic Algorithm for the Weight Setting Problem in OSPF Routing. J. Comb. Optim. M. Ericsson, Mauricio G. C. Resende, Panos M. Pardalos
2002	B	`conf`	Massive Quasi-Clique Detection. LATIN James Abello, Mauricio G. C. Resende, Sandra Sudarsky
2002	J	`jnl`	Probability Distribution of Solution Time in GRASP: An Experimental Investigation. J. Heuristics Renata M. Aiex, Mauricio G. C. Resende, Celso C. Ribeiro
2002	J	`jnl`	Randomized heuristics for the Max-Cut problem. Optim. Methods Softw. Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro
2001	J	`jnl`	"Mobile Networks and Computing". J. Comb. Optim. Mauricio G. C. Resende
2001	J	`jnl`	Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP. ACM Trans. Math. Softw. Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende
2001	J	`jnl`	Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Glob. Optim. James Abello, Sergiy Butenko, Panos M. Pardalos, Mauricio G. C. Resende
2001	J	`jnl`	Generating lower bounds for the prize collecting Steiner problem in graphs. Electron. Notes Discret. Math. Abilio Lucena, Mauricio G. C. Resende
2001	J	`jnl`	Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks S. A. Canuto, Mauricio G. C. Resende, Celso C. Ribeiro
2001	J	`jnl`	Multichannel Optical Networks: Theory and Practice. J. Comb. Optim. Mauricio G. C. Resende
2001	J	`jnl`	Piecewise Linear Time Series Estimation with GRASP. Comput. Optim. Appl. Marcelo C. Medeiros, Mauricio G. C. Resende, Álvaro Veiga
2001	—	`conf`	Reactive GRASP with path relinking for channel assignment in mobile phone networks. DIAL-M Fernando de Carvalho Gomes, Panos M. Pardalos, Carlos A. S. Oliveira, Mauricio G. C. Resende
2000	—	`conf`	A GRASP for Computing Approximate Solutions for the Three-Index Assignment Problem. IPDPS Workshops Renata M. Aiex, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
2000	J	`jnl`	A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy. J. Glob. Optim. Simone L. Martins, Mauricio G. C. Resende, Celso C. Ribeiro, Panos M. Pardalos
2000	J	`jnl`	A truncated primal-infeasible dual-feasible network interior point method. Networks Luis F. Portugal, Mauricio G. C. Resende, Geraldo Veiga, Joaquim Júdice
2000	J	`jnl`	Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. Discret. Appl. Math. Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos
1999	—	`conf`	A GRASP for frequency assignment in mobile radio networks. Mobile Networks and Computing Xin Liu, Panos M. Pardalos, Sanguthevar Rajasekaran, Mauricio G. C. Resende
1999	J	`jnl`	Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. ACM Trans. Math. Softw. Celso C. Ribeiro, Mauricio G. C. Resende
1999	—	`ch.`	Feedback Set Problems. Handbook of Combinatorial Optimization Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende
1999	—	`ch.`	Frequency Assignment Problems. Handbook of Combinatorial Optimization Robert A. Murphey, Panos M. Pardalos, Mauricio G. C. Resende
1998	J	`jnl`	A GRASP for the biquadratic assignment problem. Eur. J. Oper. Res. Thelma D. Mavridou, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
1998	J	`jnl`	A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem. J. Comb. Optim. Panos M. Pardalos, Tianbing Qian, Mauricio G. C. Resende
1998	J	`jnl`	Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP. ACM Trans. Math. Softw. Mauricio G. C. Resende, Thomas A. Feo, Stuart H. Smith
1998	J	`jnl`	Computing Approximate Solutions of the Maximum Covering Problem with GRASP. J. Heuristics Mauricio G. C. Resende
1998	—	`conf`	On maximum clique problems in very large graphs. External Memory Algorithms James Abello, Panos M. Pardalos, Mauricio G. C. Resende
1997	J	`jnl`	A GRASP for graph planarization. Networks Mauricio G. C. Resende, Celso C. Ribeiro
1997	J	`jnl`	Algorithm 769: Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems Using GRASP. ACM Trans. Math. Softw. Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
1997	—	`conf`	Greedy randomized adaptive search procedures for the Steiner problem in graphs. Randomization Methods in Algorithm Design Simone L. Martins, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro
1997	J	`jnl`	Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem. SIAM J. Optim. Panos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende, Yong Li
1996	—	`conf`	A Parallel GRASP for MAX-SAT Problems. PARA Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende
1996	J	`jnl`	Algorithm 754: Fortran Subroutines for Approximate Solution of Dense Quadratic Assignment Problems Using GRASP. ACM Trans. Math. Softw. Mauricio G. C. Resende, Panos M. Pardalos, Yong Li
1996	—	`conf`	Approximate solution of weighted MAX-SAT problems using GRASP. Satisfiability Problem: Theory and Applications Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos
1995	J	`jnl`	Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming. Oper. Res. Mauricio G. C. Resende, K. G. Ramakrishnan, Zvi Drezner
1995	J	`jnl`	Designing and reporting on computational experiments with heuristic methods. J. Heuristics Richard S. Barr, Bruce L. Golden, James P. Kelly, Mauricio G. C. Resende, William R. Stewart
1995	J	`jnl`	Greedy Randomized Adaptive Search Procedures. J. Glob. Optim. Thomas A. Feo, Mauricio G. C. Resende
1995	—	`conf`	Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP. IRREGULAR Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D. Mavridou, Mauricio G. C. Resende
1995	—	`ed.`	Workshop on Parallel Processing of Discrete Optimization Problems, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, April 28-29, 1994 Parallel Processing of Discrete Optimization Problems Panos M. Pardalos, Mauricio G. C. Resende, K. G. Ramakrishnan
1994	J	`jnl`	A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Oper. Res. Thomas A. Feo, Mauricio G. C. Resende, Stuart H. Smith
1994	J	`jnl`	Lower bounds for the quadratic assignment problem. Ann. Oper. Res. Yong Li, Panos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende
1993	—	`conf`	A GRASP for satisfiability. Cliques, Coloring, and Satisfiability Mauricio G. C. Resende, Thomas A. Feo
1993	—	`conf`	A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem. Quadratic Assignment and Related Problems Yong Li, Panos M. Pardalos, Mauricio G. C. Resende
1993	J	`jnl`	An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks. SIAM J. Optim. Mauricio G. C. Resende, Geraldo Veiga
1992	J	`jnl`	A continuous approach to inductive inference. Math. Program. Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende
1991	—	`conf`	An Efficient Implementation of a Network Interior Point Method. Network Flows And Matching Mauricio G. C. Resende, Geraldo Veiga
1991	J	`jnl`	An interior point algorithm to solve computationally difficult set covering problems. Math. Program. Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan
1990	J	`jnl`	A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension. Math. Oper. Res. Renato D. C. Monteiro, Ilan Adler, Mauricio G. C. Resende
1990	B	`conf`	Computational Experience with an Interior Point Algorithm on the Satisfiability Problem. IPCO Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende
1989	J	`jnl`	An implementation of Karmarkar's algorithm for linear programming. Math. Program. Ilan Adler, Mauricio G. C. Resende, Geraldo Veiga, Narendra Karmarkar
1989	J	`jnl`	Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm. INFORMS J. Comput. Ilan Adler, Narendra Karmarkar, Mauricio G. C. Resende, Geraldo Veiga