H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Mathematics H-index 60 Citations 19,458 145 World Ranking 248 National Ranking 132
Computer Science H-index 70 Citations 22,939 186 World Ranking 837 National Ranking 503

Research.com Recognitions

Awards & Achievements

2016 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Computer network
  • Mathematical optimization

His main research concerns Mathematical optimization, Greedy randomized adaptive search procedure, Metaheuristic, Local search and Combinatorial optimization. The Mathematical optimization study combines topics in areas such as Algorithm and Job shop scheduling. His Local search study combines topics from a wide range of disciplines, such as Beam search, Search algorithm, Hill climbing and Tabu search.

His study on Quadratic assignment problem is often connected to Iterative and incremental development and Combinational logic as part of broader study in Combinatorial optimization. His Genetic algorithm research includes elements of Representation, Heuristic and Parameterized complexity. His Heuristics research integrates issues from Maximum cut, Quality control and genetic algorithms and Genetic representation.

His most cited work include:

  • Greedy Randomized Adaptive Search Procedures (2280 citations)
  • A probabilistic heuristic for a computationally difficult set covering problem (791 citations)
  • Greedy Randomized Adaptive Search Procedures. (638 citations)

What are the main themes of his work throughout his whole career to date?

His primary scientific interests are in Mathematical optimization, Metaheuristic, Greedy randomized adaptive search procedure, Algorithm and Heuristics. His Combinatorial optimization, Heuristic, Local search, Genetic algorithm and Heuristic study are his primary interests in Mathematical optimization. Mauricio G. C. Resende works mostly in the field of Combinatorial optimization, limiting it down to topics relating to Optimization problem and, in certain cases, Global optimization.

His work deals with themes such as Assignment problem, Combinatorial optimization problem and Artificial intelligence, which intersect with Greedy randomized adaptive search procedure. His work in the fields of Algorithm, such as Interior point method, Theory of computation and Boolean satisfiability problem, overlaps with other areas such as Subroutine and Fortran. His work carried out in the field of Heuristics brings together such families of science as Routing, Distributed computing, Path, Facility location problem and Integer programming.

He most often published in these fields:

  • Mathematical optimization (55.25%)
  • Metaheuristic (26.48%)
  • Greedy randomized adaptive search procedure (26.48%)

What were the highlights of his more recent work (between 2014-2021)?

  • Mathematical optimization (55.25%)
  • Heuristics (23.29%)
  • Metaheuristic (26.48%)

In recent papers he was focusing on the following fields of study:

The scientist’s investigation covers issues in Mathematical optimization, Heuristics, Metaheuristic, Genetic algorithm and Theoretical computer science. Mauricio G. C. Resende frequently studies issues relating to Job shop scheduling and Mathematical optimization. His Heuristics research incorporates themes from Algorithm, Global optimization, Integer programming, Path and Artificial intelligence.

He combines subjects such as Biobjective optimization, Combinatorial optimization problem, Asymptotic computational complexity and Parallel computing with his study of Metaheuristic. His studies in Genetic algorithm integrate themes in fields like Network planning and design, Scheduling, Minification and Spanning tree. Mauricio G. C. Resende works mostly in the field of Greedy randomized adaptive search procedure, limiting it down to topics relating to Heuristic and, in certain cases, Structure, as a part of the same area of interest.

Between 2014 and 2021, his most popular works were:

  • A biased random-key genetic algorithm for the unequal area facility layout problem (77 citations)
  • A C++application programming interface for biased random-key genetic algorithms (60 citations)
  • Multiobjective GRASP with Path Relinking (52 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Computer network
  • Mathematical optimization

His primary areas of study are Mathematical optimization, Genetic algorithm, Metaheuristic, Heuristics and Key. He integrates many fields, such as Mathematical optimization and Component, in his works. The concepts of his Genetic algorithm study are interwoven with issues in Algorithm and Combinatorial optimization.

His study in the field of Local search also crosses realms of Implementation. In his research on the topic of Metaheuristic, Parallel computing and Computation is strongly related with Scheduling. The various areas that Mauricio G. C. Resende examines in his Heuristics study include Path and Artificial intelligence.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Greedy Randomized Adaptive Search Procedures

Thomas A. Feo;Mauricio G. C. Resende.
Journal of Global Optimization (1995)

3823 Citations

A probabilistic heuristic for a computationally difficult set covering problem

Thomas A Feo;Mauricio G. C Resende.
Operations Research Letters (1989)

1527 Citations

Greedy Randomized Adaptive Search Procedures.

Mauricio G. C. Resende;Celso C. Ribeiro.
Handbook of Metaheuristics (2003)

1142 Citations

Handbook of applied optimization

P. M. Pardalos;Mauricio G. C. Resende.
(2002)

795 Citations

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.
European Journal of Operational Research (2005)

764 Citations

An implementation of Karmarkar's algorithm for linear programming

Ilan Adler;Mauricio G. C. Resende;Geraldo Veiga;Narendra Karmarkar.
Mathematical Programming (1989)

696 Citations

Closed-loop job release control for VLSI circuit manufacturing

C.R. Glassey;M.G.C. Resende.
IEEE Transactions on Semiconductor Manufacturing (1988)

489 Citations

Biased random-key genetic algorithms for combinatorial optimization

José Fernando Gonçalves;Mauricio G. Resende.
Journal of Heuristics (2011)

452 Citations

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.
European Journal of Operational Research (2008)

436 Citations

Grasp: An Annotated Bibliography

Paola Festa;Mauricio G.C. Resende.
(2002)

428 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Mauricio G. C. Resende

Panos M. Pardalos

Panos M. Pardalos

University of Florida

Publications: 149

Rafael Martí

Rafael Martí

University of Valencia

Publications: 84

Gregory G. Raleigh

Gregory G. Raleigh

Cisco Systems (China)

Publications: 69

Celso C. Ribeiro

Celso C. Ribeiro

Fluminense Federal University

Publications: 57

Jin-Kao Hao

Jin-Kao Hao

University of Angers

Publications: 55

Angel A. Juan

Angel A. Juan

Open University of Catalonia

Publications: 54

Manuel Laguna

Manuel Laguna

University of Colorado Boulder

Publications: 54

Fred Glover

Fred Glover

University of Colorado Boulder

Publications: 52

Yannis Marinakis

Yannis Marinakis

Technical University of Crete

Publications: 39

Nenad Mladenović

Nenad Mladenović

Khalifa University of Science and Technology

Publications: 33

Stefan Voß

Stefan Voß

Universität Hamburg

Publications: 28

Tamás Terlaky

Tamás Terlaky

Lehigh University

Publications: 27

Günther R. Raidl

Günther R. Raidl

TU Wien

Publications: 26

Christian Blum

Christian Blum

Spanish National Research Council

Publications: 21

Gilbert Laporte

Gilbert Laporte

HEC Montréal

Publications: 21

Something went wrong. Please try again later.