Mauricio G. C. Resende
Orcid: 0000-0001-7462-6207Affiliations:
- Amazon.com, Seattle, Mathematical Optimization and Planning (MOP)
- AT&T Labs Research, Middletown, USA
According to our database1,
Mauricio G. C. Resende
authored at least 181 papers
between 1989 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2025
Int. Trans. Oper. Res., January, 2025
2024
Int. Trans. Oper. Res., May, 2024
A biased random-key genetic algorithm with variable mutants to solve a vehicle routing problem.
CoRR, 2024
Comput. Oper. Res., 2024
Proceedings of the Metaheuristics - 15th International Conference, 2024
2023
Comput. Oper. Res., May, 2023
cudaBRKGA-CNN: An Approach for Optimizing Convolutional Neural Network Architectures.
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.
Optim. Methods Softw., 2022
Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems.
J. Comb. Optim., 2022
Optimization of Robot Trajectory Planning with Nature-Inspired and Hybrid Quantum Algorithms.
CoRR, 2022
CoRR, 2022
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.
Proceedings of the Metaheuristics - 14th International Conference, 2022
2021
Oper. Res. Forum, 2021
A light-touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique.
Int. Trans. Oper. Res., 2021
The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications.
Eur. J. Oper. Res., 2021
2020
Oper. Res., 2020
2019
Hybrid algorithms for placement of virtual machines across geo-separated data centers.
J. Comb. Optim., 2019
2018
Proceedings of the Handbook of Heuristics., 2018
Networks, 2018
2017
Optim. Lett., 2017
A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems.
Int. Trans. Oper. Res., 2017
A biased random key genetic algorithm applied to the electric distribution network reconfiguration problem.
J. Heuristics, 2017
Ann. Oper. Res., 2017
Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017
Proceedings of the 2017 19th International Conference on Transparent Optical Networks (ICTON), 2017
2016
Int. Trans. Oper. Res., 2016
Int. Trans. Oper. Res., 2016
Comput. Oper. Res., 2016
Hybrid method with CS and BRKGA applied to the minimization of tool switches problem.
Comput. Oper. Res., 2016
Proceedings of the Genetic and Evolutionary Computation Conference, 2016
2015
Optim. Methods Softw., 2015
A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm.
J. Comb. Optim., 2015
Int. Trans. Oper. Res., 2015
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization.
Inf. Sci., 2015
Eur. J. Oper. Res., 2015
Biased Random-Key Genetic Algorithms for the Winner Determination Problem in Combinatorial Auctions.
Evol. Comput., 2015
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem.
Comput. Oper. Res., 2015
Appl. Soft Comput., 2015
A Biased Random-key Genetic Algorithm for Placement of Virtual Machines across Geo-Separated Data Centers.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015
2014
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices.
Optim. Lett., 2014
Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm.
J. Glob. Optim., 2014
Int. Trans. Oper. Res., 2014
An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling.
Int. Trans. Oper. Res., 2014
Int. Trans. Oper. Res., 2014
Proceedings of the Learning and Intelligent Optimization, 2014
Proceedings of the Genetic and Evolutionary Computation Conference, 2014
2013
Proceedings of the Hybrid Metaheuristics, 2013
Optim. Lett., 2013
J. Heuristics, 2013
Comput. Oper. Res., 2013
Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications.
Comput. Oper. Res., 2013
Design and optimization of fiber optic small-cell backhaul based on an existing fiber-to-the-node residential access network.
IEEE Commun. Mag., 2013
A small cell augmentation to a wireless network leveraging fiber-to-the-node access infrastructure for backhaul and power.
Proceedings of the 2013 Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference (OFC/NFOEC), 2013
Proceedings of the Hybrid Metaheuristics - 8th International Workshop, 2013
Proceedings of the Hybrid Metaheuristics - 8th International Workshop, 2013
Proceedings of the Genetic and Evolutionary Computation Conference, 2013
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013
Proceedings of the IEEE Congress on Evolutionary Computation, 2013
2012
Optim. Lett., 2012
Guest Editorial: Thematic Issue on "Memetic Algorithms: Theory and applications in OR/MS".
Memetic Comput., 2012
J. Heuristics, 2012
A parallel multi-population biased random-key genetic algorithm for a container loading problem.
Comput. Oper. Res., 2012
Ann. Oper. Res., 2012
2011
J. Glob. Optim., 2011
A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem.
J. Comb. Optim., 2011
J. Comb. Optim., 2011
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion.
Int. Trans. Oper. Res., 2011
Int. Trans. Oper. Res., 2011
J. Heuristics, 2011
A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem.
J. Heuristics, 2011
J. Heuristics, 2011
Proceedings of the XXXVII Latin American Computer Conference - Selected Papers, 2011
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011
2010
Optim. Lett., 2010
Continuous GRASP with a local active-set method for bound-constrained global optimization.
J. Glob. Optim., 2010
Solving scalarized multi-objective network flow problems using an interior point method.
Int. Trans. Oper. Res., 2010
GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem.
Eur. J. Oper. Res., 2010
Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010
2009
Proceedings of the Foundations of Computational Intelligence, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Int. Trans. Oper. Res., 2009
Int. Trans. Oper. Res., 2009
Discret. Appl. Math., 2009
A random key based genetic algorithm for the resource constrained project scheduling problem.
Comput. Oper. Res., 2009
2008
Eur. J. Oper. Res., 2008
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008
2007
Int. J. Comput. Sci. Eng., 2007
Ann. Oper. Res., 2007
2006
ACM J. Exp. Algorithmics, 2006
Eur. J. Oper. Res., 2006
Proceedings of the Handbook of Optimization in Telecommunications, 2006
2005
Networks, 2005
Eur. J. Oper. Res., 2005
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005
2004
Discret. Appl. Math., 2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
2003
Comput. Optim. Appl., 2003
Inteligencia Artif., 2003
On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003
Proceedings of the Handbook of Metaheuristics, 2003
2002
J. Comb. Optim., 2002
J. Heuristics, 2002
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
2001
Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP.
ACM Trans. Math. Softw., 2001
Local search with perturbations for the prize-collecting Steiner tree problem in graphs.
Networks, 2001
Finding independent sets in a graph using continuous multivariable polynomial formulations.
J. Glob. Optim., 2001
Electron. Notes Discret. Math., 2001
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001
2000
Networks, 2000
A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy.
J. Glob. Optim., 2000
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP.
Discret. Appl. Math., 2000
Proceedings of the Parallel and Distributed Processing, 2000
1999
Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP.
ACM Trans. Math. Softw., 1999
Proceedings of the Mobile Networks and Computing, 1999
Proceedings of the Handbook of Combinatorial Optimization, 1999
Proceedings of the Handbook of Combinatorial Optimization, 1999
1998
Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP.
ACM Trans. Math. Softw., 1998
J. Comb. Optim., 1998
J. Heuristics, 1998
Proceedings of the External Memory Algorithms, 1998
1997
Algorithm 769: Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems Using GRASP.
ACM Trans. Math. Softw., 1997
Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem.
SIAM J. Optim., 1997
Proceedings of the Randomization Methods in Algorithm Design, 1997
1996
Algorithm 754: Fortran Subroutines for Approximate Solution of Dense Quadratic Assignment Problems Using GRASP.
ACM Trans. Math. Softw., 1996
Proceedings of the Applied Parallel Computing, 1996
Proceedings of the Satisfiability Problem: Theory and Applications, 1996
1995
Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming.
Oper. Res., 1995
J. Heuristics, 1995
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995
1994
Oper. Res., 1994
1993
An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks.
SIAM J. Optim., 1993
Proceedings of the Quadratic Assignment and Related Problems, 1993
1992
1991
An interior point algorithm to solve computationally difficult set covering problems.
Math. Program., 1991
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.
Math. Oper. Res., 1990
Computational Experience with an Interior Point Algorithm on the Satisfiability Problem.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990
1989
Math. Program., 1989
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm.
INFORMS J. Comput., 1989