World's Best Scientists 2026 revealed!
Mauricio G. C. Resende

Mauricio G. C. Resende

Award Badge
Mathematics
USA
2026

D-Index & Metrics

Computer Science

D-Index
85
Citations
33600
World Ranking
795
National Ranking
432

Mathematics

D-Index
84
Citations
32963
World Ranking
113
National Ranking
64

Research.com Recognitions

  • 2026 - Research.com Mathematics in United States Leader Award
  • 2025 - Research.com Mathematics in United States Leader Award
  • 2016 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)

Overview

Mauricio G. C. Resende is affiliated with the University of Washington in the United States and has contributed extensively to research in computer science and engineering. Their work spans multiple specialized fields including industrial and manufacturing engineering, artificial intelligence, computational theory and mathematics, computer networks and communications, and computer vision and pattern recognition.

The scientist's research topics focus primarily on areas such as vehicle routing optimization methods, metaheuristic optimization algorithms, optimization and search problems, scheduling and optimization algorithms, optimization and packing problems, advanced manufacturing and logistics optimization, as well as facility location and emergency management.

Frequent publication venues for Mauricio G. C. Resende include:

  • arXiv (Cornell University)
  • International Transactions in Operational Research
  • Computers & Operations Research
  • European Journal of Operational Research
  • SSRN Electronic Journal

Recent papers authored or co-authored by Resende provide insight into the scope of their research:

  • Biased random-key genetic algorithms: A review, 2024, European Journal of Operational Research
  • A light-touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique, 2020, International Transactions in Operational Research
  • Optimization of Robot Trajectory Planning with Nature-Inspired and Hybrid Quantum Algorithms, 2022, arXiv (Cornell University)
  • Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs, 2020, Operations Research
  • A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation, 2021, Optimization Methods & Software

Collaborations have been an integral part of their research activities. Frequent co-authors include:

  • Paola Festa
  • Mariana A. Londe
  • Luciana Fontes Pessôa
  • Andrew V. Goldberg
  • Alexander Noe

Mauricio G. C. Resende's work includes recognition as a Fellow of the Institute for Operations Research and the Management Sciences (INFORMS) awarded in 2016. This affiliation signals involvement with professional communities committed to the fields of operations research and management sciences.

Best Publications

  • Greedy Randomized Adaptive Search Procedures

    Thomas A. Feo;Mauricio G. C. Resende

  • A probabilistic heuristic for a computationally difficult set covering problem

    Thomas A Feo;Mauricio G. C Resende

  • Greedy Randomized Adaptive Search Procedures.

    Mauricio G. C. Resende;Celso C. Ribeiro

  • Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications

    Mauricio G.C. Resende;Celso C. Ribeiro

  • A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem

    José Fernando Gonçalves;Jorge José de Magalhães Mendes;Maurı́cio G.C. Resende

  • Handbook of applied optimization

    P. M. Pardalos;Mauricio G. C. Resende

  • Designing and reporting on computational experiments with heuristic methods

    Richard S. Barr;Bruce L. Golden;James P. Kelly;Mauricio G. C. Resende

  • An implementation of Karmarkar's algorithm for linear programming

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

  • Biased random-key genetic algorithms for combinatorial optimization

    José Fernando Gonçalves;Mauricio G. Resende

  • A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set

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

  • 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

  • Closed-loop job release control for VLSI circuit manufacturing

    C.R. Glassey;M.G.C. Resende

  • Massive Quasi-Clique Detection

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

  • A Hybrid Heuristic for the p -Median Problem

    Mauricio G. C. Resende;Renato F. Werneck

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

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

  • Grasp: An Annotated Bibliography

    Paola Festa;Mauricio G.C. Resende

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

    Yong Li;Panos Pardalos;Mauricio G. C. Resende

  • An evolutionary algorithm for manufacturing cell formation

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

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

    J. J. M. Mendes;J. F. Gonçalves;M. G. C. Resende

  • Parallel GRASP with path-relinking for job shop scheduling

    R. M. Aiex;S. Binato;M. G. C. Resende

  • Greedy Randomized Adaptive Search Procedures.

    Mauricio G. C. Resende

Frequent Co-Authors

Panos M. Pardalos
Panos M. Pardalos University of Florida
Celso C. Ribeiro
Celso C. Ribeiro Fluminense Federal University
Rafael Martí
Rafael Martí University of Valencia
Renato F. Werneck
Renato F. Werneck Microsoft (United States)
Abraham Duarte
Abraham Duarte King Juan Carlos University
Mikkel Thorup
Mikkel Thorup University of Copenhagen
Timothy G. Griffin
Timothy G. Griffin University of Cambridge
Jennifer Rexford
Jennifer Rexford Princeton University
Nick Duffield
Nick Duffield Texas A&M University
Ilias Diakonikolas
Ilias Diakonikolas University of Wisconsin–Madison

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a Mathematics degree in the USA opens doors to various interdisciplinary fields that combine analytical skills with business acumen. Many students expand their expertise by exploring online degrees, blending quantitative knowledge with practical applications.

For those interested in leadership roles, accelerated online mba programs offer a faster route to develop management and strategic decision-making skills without pausing their careers. Similarly, finance professionals benefit from affordable options like the cheapest online master's in finance, which provide specialized financial training that complements a math background.

Entrepreneurial-minded graduates often look towards marketing, where data-driven strategies are crucial. Leveraging a masters in marketing can enhance understanding of market trends and consumer behavior, creating a strong career edge. Meanwhile, those focused on business leadership can consider the cheapest online dba to gain advanced expertise in organizational management with minimal financial burden.

These related degree options highlight how mathematics graduates can diversify their skills and increase employability. Exploring affordable and accelerated programs online helps students balance cost, time, and career goals effectively.

Best Scientists Citing Mauricio G. C. Resende

Trending Scientists

Recently Published Articles