Mauricio G. C. Resende

According to our database, Mauricio G. C. Resende authored at least 175 papers between 1989 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

A biased random-key genetic algorithm for the home health care problem.

Alberto Francisco Kummer Neto, Olinto C. B. de Araújo, Luciana S. Buriol, Mauricio G. C. Resende

Int. Trans. Oper. Res., May, 2024

2023

Efficient GRASP solution approach for the Prisoner Transportation Problem.

Daniele Ferone, Paola Festa, Tommaso Pastore, Mauricio G. C. Resende

Comput. Oper. Res., May, 2023

Amazon Locker Capacity Management.

Samyukta Sethuraman, Ankur Bansal, Setareh Mardan, Mauricio G. C. Resende, Timothy L. Jacobs

CoRR, 2023

Biased Random-Key Genetic Algorithms: A Review.

Mariana A. Londe, Luciana S. Pessoa, Carlos Eduardo de Andrade, Mauricio G. C. Resende

CoRR, 2023

cudaBRKGA-CNN: An Approach for Optimizing Convolutional Neural Network Architectures.

Andersson A. Da Silva, Ricardo M. A. Silva, Amanda S. Xavier, Thiago D. Bispo, Geraldo R. Mateus, Mauricio G. C. Resende

Proceedings of the IEEE Congress on Evolutionary Computation, 2023

2022

A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation.

Beatriz Brito Oliveira, Maria Antónia Carravilla, José Fernando Oliveira, Mauricio G. C. Resende

Optim. Methods Softw., 2022

Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems.

Dalila B. M. M. Fontes, Seyed Mahdi Homayouni, Mauricio G. C. Resende

J. Comb. Optim., 2022

Optimization of Robot Trajectory Planning with Nature-Inspired and Hybrid Quantum Algorithms.

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

CoRR, 2022

A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems.

Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen

CoRR, 2022

A Local Search Algorithm for Large Maximum Weight Independent Set Problems.

Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

A BRKGA with Implicit Path-Relinking for the Vehicle Routing Problem with Occasional Drivers and Time Windows.

Paola Festa, Francesca Guerriero, Mauricio G. C. Resende, Edoardo Scalzo

Proceedings of the Metaheuristics - 14th International Conference, 2022

2021

New Instances for Maximum Weight Independent Set From a Vehicle Routing Application.

Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen

Oper. Res. Forum, 2021

A light-touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique.

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

Int. Trans. Oper. Res., 2021

The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications.

Carlos Eduardo de Andrade, Rodrigo F. Toso, José Fernando Gonçalves, Mauricio G. C. Resende

Eur. J. Oper. Res., 2021

2020

Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs.

David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen

Oper. Res., 2020

2019

Hybrid algorithms for placement of virtual machines across geo-separated data centers.

Fernando Stefanello, Vaneet Aggarwal, Luciana S. Buriol, Mauricio G. C. Resende

J. Comb. Optim., 2019

2018

Random-Key Genetic Algorithms.

José Fernando Gonçalves, Mauricio G. C. Resende

Proceedings of the Handbook of Heuristics., 2018

Biased Random-Key Genetic Progamming.

José Fernando Gonçalves, Mauricio G. C. Resende

Proceedings of the Handbook of Heuristics., 2018

GRASP.

Paola Festa, Mauricio G. C. Resende

Proceedings of the Handbook of Heuristics., 2018

Preface: Recent advances in telecommunications networks planning and operation.

Bernard Fortz, Dimitri Papadimitriou, Mauricio G. C. Resende

Networks, 2018

2017

A biased random-key genetic algorithm for the tree of hubs location problem.

Luciana S. Pessoa, Andréa C. Santos, Mauricio G. C. Resende

Optim. Lett., 2017

A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems.

Julliany S. Brandão, Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro

Int. Trans. Oper. Res., 2017

A biased random key genetic algorithm applied to the electric distribution network reconfiguration problem.

Haroldo de Faria Jr., Mauricio G. C. Resende, Damien Ernst

J. Heuristics, 2017

On the minimization of traffic congestion in road networks with tolls.

Fernando Stefanello, Luciana S. Buriol, Michael J. Hirsch, Panos M. Pardalos, Tania Querido, Mauricio G. C. Resende, Marcus Ritt

Ann. Oper. Res., 2017

A New Local Search for the p-Center Problem Based on the Critical Vertex Concept.

Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende

Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

On the fast solution of the p-center problem.

Daniele Ferone, Paola Festa, Antonio Napoletano, Mauricio G. C. Resende

Proceedings of the 2017 19th International Conference on Transparent Optical Networks (ICTON), 2017

2016

Heuristics for a hub location-routing problem.

Mauro Cardoso Lopes, Carlos Eduardo de Andrade, Thiago Alves de Queiroz, Mauricio G. C. Resende, Flávio Keidi Miyazawa

Networks, 2016

A biased random-key genetic algorithm for the minimization of open stacks problem.

José Fernando Gonçalves, Mauricio G. C. Resende, Miguel Dias Costa

Int. Trans. Oper. Res., 2016

Hybridizations of GRASP with path relinking for the far from most string problem.

Daniele Ferone, Paola Festa, Mauricio G. C. Resende

Int. Trans. Oper. Res., 2016

A biased random key genetic algorithm for the field technician scheduling problem.

Ricardo B. Damm, Mauricio G. C. Resende, Débora P. Ronconi

Comput. Oper. Res., 2016

Hybrid method with CS and BRKGA applied to the minimization of tool switches problem.

Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena, Edson Luiz França Senne, Mauricio G. C. Resende

Comput. Oper. Res., 2016

Biased Ranom-Key Genetic Algorithms: An Advanced Tutorial.

Mauricio G. C. Resende, Celso C. Ribeiro

Proceedings of the Genetic and Evolutionary Computation Conference, 2016

2015

A C++application programming interface for biased random-key genetic algorithms.

Rodrigo F. Toso, Mauricio G. C. Resende

Optim. Methods Softw., 2015

A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm.

Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos

J. Comb. Optim., 2015

A biased random-key genetic algorithm for single-round divisible load scheduling.

Julliany S. Brandão, Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro

Int. Trans. Oper. Res., 2015

Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization.

Abraham Duarte, Jesús Sánchez-Oro, Mauricio G. C. Resende, Fred W. Glover, Rafael Martí

Inf. Sci., 2015

Multiobjective GRASP with Path Relinking.

Rafael Martí, Vicente Campos, Mauricio G. C. Resende, Abraham Duarte

Eur. J. Oper. Res., 2015

A biased random-key genetic algorithm for the unequal area facility layout problem.

José Fernando Gonçalves, Mauricio G. C. Resende

Eur. J. Oper. Res., 2015

Biased Random-Key Genetic Algorithms for the Winner Determination Problem in Combinatorial Auctions.

Carlos Eduardo de Andrade, Rodrigo Franco Toso, Mauricio G. C. Resende, Flávio Keidi Miyazawa

Evol. Comput., 2015

A biased random-key genetic algorithm for the capacitated minimum spanning tree problem.

Efrain Ruiz, Maria Albareda-Sambola, Elena Fernández, Mauricio G. C. Resende

Comput. Oper. Res., 2015

A biased random-key genetic algorithm for wireless backhaul network design.

Carlos Eduardo de Andrade, Mauricio G. C. Resende, Weiyi Zhang, Rakesh K. Sinha, Kenneth C. Reichmann, Robert D. Doverspike, Flávio Keidi Miyazawa

Appl. Soft Comput., 2015

A Biased Random-key Genetic Algorithm for Placement of Virtual Machines across Geo-Separated Data Centers.

Fernando Stefanello, Vaneet Aggarwal, Luciana Salete Buriol, José Fernando Gonçalves, Mauricio G. C. Resende

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

2014

An edge-swap heuristic for generating spanning trees with minimum number of branch vertices.

Ricardo M. A. Silva, Diego M. Silva, Mauricio G. C. Resende, Geraldo R. Mateus, José Fernando Gonçalves, Paola Festa

Optim. Lett., 2014

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

Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos

J. Glob. Optim., 2014

Preface.

Sergiy Butenko, Ding-Zhu Du, Mauricio G. C. Resende

J. Comb. Optim., 2014

Randomized heuristics for the family traveling salesperson problem.

Luis F. Morán-Mirabal, José Luis González Velarde, Mauricio G. C. Resende

Int. Trans. Oper. Res., 2014

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

José Fernando Gonçalves, Mauricio G. C. Resende

Int. Trans. Oper. Res., 2014

Improved heuristics for the regenerator location problem.

Abraham Duarte, Rafael Martí, Mauricio G. C. Resende, Ricardo M. A. Silva

Int. Trans. Oper. Res., 2014

GRASP with Path-Relinking for the Maximum Contact Map Overlap Problem.

Ricardo M. A. Silva, Mauricio G. C. Resende, Paola Festa, Filipe L. Valentim, Francisco Nascimento Junior

Proceedings of the Learning and Intelligent Optimization, 2014

Evolutionary algorithms for overlapping correlation clustering.

Carlos Eduardo de Andrade, Mauricio G. C. Resende, Howard J. Karloff, Flávio Keidi Miyazawa

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013

Hybridizations of GRASP with Path-Relinking.

Paola Festa, Mauricio G. C. Resende

Proceedings of the Hybrid Metaheuristics, 2013

A Python/C library for bound-constrained global optimization with continuous GRASP.

Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos, Michael J. Hirsch

Optim. Lett., 2013

Randomized heuristics for handover minimization in mobility networks.

Luis F. Morán-Mirabal, José Luis González Velarde, Mauricio G. C. Resende, Ricardo M. A. Silva

J. Heuristics, 2013

Multi-start methods for combinatorial optimization.

Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro

Eur. J. Oper. Res., 2013

A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering.

Luciana S. Pessoa, Mauricio G. C. Resende, Celso C. Ribeiro

Comput. Oper. Res., 2013

Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications.

Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro

Comput. Oper. Res., 2013

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

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

IEEE Commun. Mag., 2013

A small cell augmentation to a wireless network leveraging fiber-to-the-node access infrastructure for backhaul and power.

Patrick Iannone, Kenneth C. Reichmann, Chathurika Ranaweera, Mauricio G. C. Resende

Proceedings of the 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC), 2013

Automatic Tuning of GRASP with Evolutionary Path-Relinking.

Luis F. Morán-Mirabal, José Luis González Velarde, Mauricio G. C. Resende

Proceedings of the Hybrid Metaheuristics - 8th International Workshop, 2013

Hybrid Metaheuristics for the Far From Most String Problem.

Daniele Ferone, Paola Festa, Mauricio G. C. Resende

Proceedings of the Hybrid Metaheuristics - 8th International Workshop, 2013

Biased random-key genetic algorithm for linearly-constrained global optimization.

Ricardo Martins Abreu e Silva, Mauricio G. C. Resende, Panos M. Pardalos, Joao L. Faco

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem.

Carlos Eduardo de Andrade, Flávio Keidi Miyazawa, Mauricio G. C. Resende

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Biased random-key genetic algorithm for nonlinearly-constrained global optimization.

Ricardo M. A. Silva, Mauricio G. C. Resende, Panos M. Pardalos, Joao L. Faco

Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012

A biased random-key genetic algorithm for the Steiner triple covering problem.

Mauricio G. C. Resende, Rodrigo F. Toso, José Fernando Gonçalves, Ricardo M. A. Silva

Optim. Lett., 2012

Guest Editorial: Thematic Issue on "Memetic Algorithms: Theory and applications in OR/MS".

Enrique Alba, Mauricio G. C. Resende, María E. Urquhart, Meng-Hiot Lim

Memetic Comput., 2012

Path-relinking intensification methods for stochastic local search algorithms.

Celso C. Ribeiro, Mauricio G. C. Resende

J. Heuristics, 2012

Fast local search for the maximum independent set problem.

Diogo Vieira Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck

J. Heuristics, 2012

A parallel multi-population biased random-key genetic algorithm for a container loading problem.

José Fernando Gonçalves, Mauricio G. C. Resende

Comput. Oper. Res., 2012

Parallel hybrid heuristics for the permutation flow shop problem.

Martín Gómez Ravetti, Carlos Riveros, Alexandre Mendes, Mauricio G. C. Resende, Panos M. Pardalos

Ann. Oper. Res., 2012

2011

GRASP: basic components and enhancements.

Paola Festa, Mauricio G. C. Resende

Telecommun. Syst., 2011

Restart strategies for GRASP with path-relinking heuristics.

Mauricio G. C. Resende, Celso C. Ribeiro

Optim. Lett., 2011

Experiments with LAGRASP heuristic for set <i>k</i>-covering.

Luciana S. Pessoa, Mauricio G. C. Resende, Celso C. Ribeiro

Optim. Lett., 2011

GRASP with path relinking heuristics for the antibandwidth problem.

Abraham Duarte, Rafael Martí, Mauricio G. C. Resende, Ricardo M. A. Silva

Networks, 2011

A biased random-key genetic algorithm for routing and wavelength assignment.

Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro

J. Glob. Optim., 2011

A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem.

José Fernando Gonçalves, Mauricio G. C. Resende

J. Comb. Optim., 2011

Revised GRASP with path-relinking for the linear ordering problem.

Wanpracha Art Chaovalitwongse, Carlos A. S. Oliveira, Bruno Chiarini, Panos M. Pardalos, Mauricio G. C. Resende

J. Comb. Optim., 2011

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

Roger Reis, Marcus Ritt, Luciana S. Buriol, Mauricio G. C. Resende

Int. Trans. Oper. Res., 2011

Correspondence of projected 3-D points and lines using a continuous GRASP.

Michael J. Hirsch, Panos M. Pardalos, Mauricio G. C. Resende

Int. Trans. Oper. Res., 2011

GRASP with path-relinking for the generalized quadratic assignment problem.

Geraldo R. Mateus, Mauricio G. C. Resende, Ricardo M. A. Silva

J. Heuristics, 2011

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

José Fernando Gonçalves, Mauricio G. C. Resende, Jorge José de Magalhães Mendes

J. Heuristics, 2011

Biased random-key genetic algorithms for combinatorial optimization.

José Fernando Gonçalves, Mauricio G. C. Resende

J. Heuristics, 2011

BRKGA Algorithm for the Capacitated Arc Routing Problem.

Cristian A. Martínez, Irene Loiseau, Mauricio G. C. Resende, Silvia Luz Rodríguez

Proceedings of the XXXVII Latin American Computer Conference - Selected Papers, 2011

An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem.

Diego M. Silva, Ricardo M. A. Silva, Geraldo R. Mateus, José Fernando Gonçalves, Mauricio G. C. Resende, Paola Festa

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data.

Rafael M. D. Frinhani, Ricardo M. A. Silva, Geraldo R. Mateus, Paola Festa, Mauricio G. C. Resende

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Disjoint-Path Facility Location: Theory and Practice.

Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen

Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010

A biased random-key genetic algorithm for road congestion minimization.

Luciana S. Buriol, Michael J. Hirsch, Panos M. Pardalos, Tania Querido, Mauricio G. C. Resende, Marcus Ritt

Optim. Lett., 2010

Continuous GRASP with a local active-set method for bound-constrained global optimization.

Ernesto G. Birgin, Erico M. Gozzi, Mauricio G. C. Resende, Ricardo M. A. Silva

J. Glob. Optim., 2010

Solving scalarized multi-objective network flow problems using an interior point method.

Margarida Fonseca, José Rui Figueira, Mauricio G. C. Resende

Int. Trans. Oper. Res., 2010

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem.

Mariá Cristina Vasconcelos Nascimento, Mauricio G. C. Resende, Franklina Maria Bragion Toledo

Eur. J. Oper. Res., 2010

Speeding up continuous GRASP.

Michael J. Hirsch, Panos M. Pardalos, Mauricio G. C. Resende

Eur. J. Oper. Res., 2010

GRASP and path relinking for the max-min diversity problem.

Mauricio G. C. Resende, Rafael Martí, Micael Gallego, Abraham Duarte

Comput. Oper. Res., 2010

Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm.

Paola Festa, José Fernando Gonçalves, Mauricio G. C. Resende, Ricardo M. A. Silva

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009

Hybrid GRASP Heuristics.

Paola Festa, Mauricio G. C. Resende

Proceedings of the Foundations of Computational Intelligence, 2009

Graph Planarization.

Mauricio G. C. Resende, Celso C. Ribeiro

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Greedy Randomized Adaptive Search Procedures.

Mauricio G. C. Resende

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Feedback Set Problems.

Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

An annotated bibliography of GRASP-Part II: Applications.

Paola Festa, Mauricio G. C. Resende

Int. Trans. Oper. Res., 2009

An annotated bibliography of GRASP - Part I: Algorithms.

Paola Festa, Mauricio G. C. Resende

Int. Trans. Oper. Res., 2009

A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs.

Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende

Discret. Appl. Math., 2009

A random key based genetic algorithm for the resource constrained project scheduling problem.

Jorge José de Magalhães Mendes, José Fernando Gonçalves, Mauricio G. C. Resende

Comput. Oper. Res., 2009

2008

Speeding Up Dynamic Shortest-Path Algorithms.

Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup

INFORMS J. Comput., 2008

A genetic algorithm for the resource constrained multi-project scheduling problem.

José Fernando Gonçalves, Jorge José de Magalhães Mendes, Mauricio G. C. Resende

Eur. J. Oper. Res., 2008

Efficient Implementations of Heuristics for Routing and Wavelength Assignment.

Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

2007

TIE breaking: tunable interdomain egress selection.

Renata Teixeira, Timothy G. Griffin, Mauricio G. C. Resende, Jennifer Rexford

IEEE/ACM Trans. Netw., 2007

Global optimization by continuous grasp.

Michael J. Hirsch, Cláudio Nogueira de Meneses, Panos M. Pardalos, Mauricio G. C. Resende

Optim. Lett., 2007

TTT plots: a perl program to create time-to-target plots.

Renata M. Aiex, Mauricio G. C. Resende, Celso C. Ribeiro

Optim. Lett., 2007

Survivable IP network design with OSPF routing.

Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup

Networks, 2007

Streaming cache placement problems: complexity and algorithms.

Carlos A. S. Oliveira, Panos M. Pardalos, Oleg A. Prokopyev, Mauricio G. C. Resende

Int. J. Comput. Sci. Eng., 2007

A fast swap-based local search procedure for location problems.

Mauricio G. C. Resende, Renato Fonseca F. Werneck

Ann. Oper. Res., 2007

2006

GRASP with path relinking for the weighted MAXSAT problem.

Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende

ACM J. Exp. Algorithmics, 2006

A hybrid multistart heuristic for the uncapacitated facility location problem.

Mauricio G. C. Resende, Renato Fonseca F. Werneck

Eur. J. Oper. Res., 2006

Optimization Problems in Multicast Tree Construction.

Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio G. C. Resende

Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005

A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing.

Luciana S. Buriol, Mauricio G. C. Resende, Celso C. Ribeiro, Mikkel Thorup

Networks, 2005

GRASP with Path Relinking for Three-Index Assignment.

Renata M. Aiex, Mauricio G. C. Resende, Panos M. Pardalos, Gerardo Toraldo

INFORMS J. Comput., 2005

A hybrid genetic algorithm for the job shop scheduling problem.

José Fernando Gonçalves, Jorge José de Magalhães Mendes, Mauricio G. C. Resende

Eur. J. Oper. Res., 2005

GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem.

Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2004

A Hybrid Heuristic for the p-Median Problem.

Mauricio G. C. Resende, Renato Fonseca F. Werneck

J. Heuristics, 2004

Strong lower bounds for the prize collecting Steiner problem in graphs.

Abilio Lucena, Mauricio G. C. Resende

Discret. Appl. Math., 2004

An evolutionary algorithm for manufacturing cell formation.

José Fernando Gonçalves, Mauricio G. C. Resende

Comput. Ind. Eng., 2004

GRASP with Path-Relinking for the Quadratic Assignment Problem.

Carlos A. S. Oliveira, Panos M. Pardalos, Mauricio G. C. Resende

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003

Parallel GRASP with path-relinking for job shop scheduling.

Renata M. Aiex, S. Binato, Mauricio G. C. Resende

Parallel Comput., 2003

An annotated bibliography of network interior point methods.

Mauricio G. C. Resende, Geraldo Veiga

Networks, 2003

A GRASP with path-relinking for private virtual circuit routing.

Mauricio G. C. Resende, Celso C. Ribeiro

Networks, 2003

A Study of Preconditioners for Network Interior Point Methods.

Joaquim João Júdice, João Patrício, Luis F. Portugal, Mauricio G. C. Resende, Geraldo Veiga

Comput. Optim. Appl., 2003

GRASP: Procedimientos de búsquedas miopes aleatorizados y adaptativos.

Mauricio G. C. Resende, José Luis González Velarde

Inteligencia Artif., 2003

On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem.

Mauricio G. C. Resende, Renato Fonseca F. Werneck

Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

Greedy Randomized Adaptive Search Procedures.

Mauricio G. C. Resende, Celso C. Ribeiro

Proceedings of the Handbook of Metaheuristics, 2003

2002

Randomized heuristics for the Max-Cut problem.

Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro

Optim. Methods Softw., 2002

A Genetic Algorithm for the Weight Setting Problem in OSPF Routing.

M. Ericsson, Mauricio G. C. Resende, Panos M. Pardalos

J. Comb. Optim., 2002

Probability Distribution of Solution Time in GRASP: An Experimental Investigation.

Renata M. Aiex, Mauricio G. C. Resende, Celso C. Ribeiro

J. Heuristics, 2002

Massive Quasi-Clique Detection.

James Abello, Mauricio G. C. Resende, Sandra Sudarsky

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001

Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP.

Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende

ACM Trans. Math. Softw., 2001

Local search with perturbations for the prize-collecting Steiner tree problem in graphs.

S. A. Canuto, Mauricio G. C. Resende, Celso C. Ribeiro

Networks, 2001

Finding independent sets in a graph using continuous multivariable polynomial formulations.

James Abello, Sergiy Butenko, Panos M. Pardalos, Mauricio G. C. Resende

J. Glob. Optim., 2001

Multichannel Optical Networks: Theory and Practice.

Mauricio G. C. Resende

J. Comb. Optim., 2001

"Mobile Networks and Computing".

Mauricio G. C. Resende

J. Comb. Optim., 2001

Generating lower bounds for the prize collecting Steiner problem in graphs.

Abilio Lucena, Mauricio G. C. Resende

Electron. Notes Discret. Math., 2001

Piecewise Linear Time Series Estimation with GRASP.

Marcelo C. Medeiros, Mauricio G. C. Resende, Álvaro Veiga

Comput. Optim. Appl., 2001

Reactive GRASP with path relinking for channel assignment in mobile phone networks.

Fernando de Carvalho Gomes, Panos M. Pardalos, Carlos A. S. Oliveira, Mauricio G. C. Resende

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000

A truncated primal-infeasible dual-feasible network interior point method.

Luis F. Portugal, Mauricio G. C. Resende, Geraldo Veiga, Joaquim Júdice

Networks, 2000

A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy.

Simone L. Martins, Mauricio G. C. Resende, Celso C. Ribeiro, Panos M. Pardalos

J. Glob. Optim., 2000

Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP.

Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos

Discret. Appl. Math., 2000

A GRASP for Computing Approximate Solutions for the Three-Index Assignment Problem.

Renata M. Aiex, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende

Proceedings of the Parallel and Distributed Processing, 2000

1999

Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP.

Celso C. Ribeiro, Mauricio G. C. Resende

ACM Trans. Math. Softw., 1999

A GRASP for frequency assignment in mobile radio networks.

Xin Liu, Panos M. Pardalos, Sanguthevar Rajasekaran, Mauricio G. C. Resende

Proceedings of the Mobile Networks and Computing, 1999

Frequency Assignment Problems.

Robert A. Murphey, Panos M. Pardalos, Mauricio G. C. Resende

Proceedings of the Handbook of Combinatorial Optimization, 1999

Feedback Set Problems.

Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende

Proceedings of the Handbook of Combinatorial Optimization, 1999

1998

Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP.

Mauricio G. C. Resende, Thomas A. Feo, Stuart H. Smith

ACM Trans. Math. Softw., 1998

A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem.

Panos M. Pardalos, Tianbing Qian, Mauricio G. C. Resende

J. Comb. Optim., 1998

Computing Approximate Solutions of the Maximum Covering Problem with GRASP.

Mauricio G. C. Resende

J. Heuristics, 1998

A GRASP for the biquadratic assignment problem.

Thelma D. Mavridou, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende

Eur. J. Oper. Res., 1998

On maximum clique problems in very large graphs.

James Abello, Panos M. Pardalos, Mauricio G. C. Resende

Proceedings of the External Memory Algorithms, 1998

1997

Algorithm 769: Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems Using GRASP.

Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende

ACM Trans. Math. Softw., 1997

Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem.

Panos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende, Yong Li

SIAM J. Optim., 1997

A GRASP for graph planarization.

Mauricio G. C. Resende, Celso C. Ribeiro

Networks, 1997

Greedy randomized adaptive search procedures for the Steiner problem in graphs.

Simone L. Martins, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro

Proceedings of the Randomization Methods in Algorithm Design, 1997

1996

Algorithm 754: Fortran Subroutines for Approximate Solution of Dense Quadratic Assignment Problems Using GRASP.

Mauricio G. C. Resende, Panos M. Pardalos, Yong Li

ACM Trans. Math. Softw., 1996

A Parallel GRASP for MAX-SAT Problems.

Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende

Proceedings of the Applied Parallel Computing, 1996

Approximate solution of weighted MAX-SAT problems using GRASP.

Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos

Proceedings of the Satisfiability Problem: Theory and Applications, 1996

1995

Greedy Randomized Adaptive Search Procedures.

Thomas A. Feo, Mauricio G. C. Resende

J. Glob. Optim., 1995

Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming.

Mauricio G. C. Resende, K. G. Ramakrishnan, Zvi Drezner

Oper. Res., 1995

Designing and reporting on computational experiments with heuristic methods.

Richard S. Barr, Bruce L. Golden, James P. Kelly, Mauricio G. C. Resende, William R. Stewart

J. Heuristics, 1995

Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP.

Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D. Mavridou, Mauricio G. C. Resende

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

1994

A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set.

Thomas A. Feo, Mauricio G. C. Resende, Stuart H. Smith

Oper. Res., 1994

Lower bounds for the quadratic assignment problem.

Yong Li, Panos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende

Ann. Oper. Res., 1994

1993

An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks.

Mauricio G. C. Resende, Geraldo Veiga

SIAM J. Optim., 1993

A GRASP for satisfiability.

Mauricio G. C. Resende, Thomas A. Feo

Proceedings of the Cliques, 1993

A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem.

Yong Li, Panos M. Pardalos, Mauricio G. C. Resende

Proceedings of the Quadratic Assignment and Related Problems, 1993

1992

A continuous approach to inductive inference.

Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende

Math. Program., 1992

1991

An interior point algorithm to solve computationally difficult set covering problems.

Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan

Math. Program., 1991

An Efficient Implementation of a Network Interior Point Method.

Mauricio G. C. Resende, Geraldo Veiga

Proceedings of the Network Flows And Matching, 1991

1990

A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension.

Renato D. C. Monteiro, Ilan Adler, Mauricio G. C. Resende

Math. Oper. Res., 1990

Computational Experience with an Interior Point Algorithm on the Satisfiability Problem.

Anil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989

An implementation of Karmarkar's algorithm for linear programming.

Ilan Adler, Mauricio G. C. Resende, Geraldo Veiga, Narendra Karmarkar

Math. Program., 1989

Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm.

Ilan Adler, Narendra Karmarkar, Mauricio G. C. Resende, Geraldo Veiga

INFORMS J. Comput., 1989