H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 54 Citations 19,658 212 World Ranking 2273 National Ranking 4
Mathematics H-index 57 Citations 19,639 221 World Ranking 322 National Ranking 2

Research.com Recognitions

Awards & Achievements

2012 - Member of Academia Europaea

Overview

What is he best known for?

The fields of study he is best known for:

  • Mathematical optimization
  • Algorithm
  • Artificial intelligence

His primary areas of investigation include Mathematical optimization, Variable neighborhood search, Metaheuristic, Heuristics and Local search. His Mathematical optimization study frequently links to related topics such as Variable. Variable neighborhood search is a subfield of Algorithm that he studies.

His Metaheuristic study incorporates themes from Global optimization, Search algorithm, Class, Travelling salesman problem and Operations research. Nenad Mladenović usually deals with Heuristics and limits it to topics linked to Heuristic and Bibliography. His biological study spans a wide range of topics, including Best-first search and Branch and bound.

His most cited work include:

  • Variable neighborhood search (2786 citations)
  • Variable neighborhood search: Principles and applications (1476 citations)
  • Variable neighbourhood search: methods and applications (583 citations)

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

His primary areas of study are Mathematical optimization, Variable neighborhood search, Metaheuristic, Heuristic and Heuristics. His Mathematical optimization study integrates concerns from other disciplines, such as Variable and Algorithm. His Variable research is multidisciplinary, incorporating perspectives in Descent and Benchmark.

Explained sum of squares and Combinatorics is closely connected to Cluster analysis in his research, which is encompassed under the umbrella topic of Variable neighborhood search. His Metaheuristic research is multidisciplinary, relying on both Global optimization and Operations research. His research in Heuristic intersects with topics in Genetic algorithm and Solver.

He most often published in these fields:

  • Mathematical optimization (74.39%)
  • Variable neighborhood search (61.99%)
  • Metaheuristic (36.39%)

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

  • Variable neighborhood search (61.99%)
  • Mathematical optimization (74.39%)
  • Metaheuristic (36.39%)

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

His scientific interests lie mostly in Variable neighborhood search, Mathematical optimization, Metaheuristic, Heuristics and Variable. His work deals with themes such as Computational intelligence, Set, Cluster analysis, Heuristic and Optimization problem, which intersect with Variable neighborhood search. Nenad Mladenović combines subjects such as Process and Benchmark with his study of Mathematical optimization.

His work in Metaheuristic covers topics such as Job shop scheduling which are related to areas like Optimal decision and Robustness. His studies in Heuristics integrate themes in fields like Simple, Graph, Time horizon and Economic dispatch. His research on Variable also deals with topics like

  • Automatic programming which is related to area like Tree,
  • Theoretical computer science which connect with Combinatorial optimization.

Between 2015 and 2021, his most popular works were:

  • Variable neighborhood search: basics and variants (114 citations)
  • Variable Neighborhood Search. (72 citations)
  • Less is more: Basic variable neighborhood search for minimum differential dispersion problem (46 citations)

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

  • Mathematical optimization
  • Artificial intelligence
  • Algorithm

The scientist’s investigation covers issues in Mathematical optimization, Variable neighborhood search, Heuristics, Local search and Metaheuristic. His Mathematical optimization research is multidisciplinary, incorporating elements of Theory of computation, Computational intelligence and Cluster analysis. The various areas that Nenad Mladenović examines in his Variable neighborhood search study include Variable, Preventive maintenance, Heuristic, Benchmark and Combinatorial optimization.

His Heuristics research includes elements of Graph, Solver, Set and Electric power system. His research investigates the connection between Local search and topics such as GRASP that intersect with problems in Effective method, Parallel metaheuristic and Tabu search. His research integrates issues of Power system simulation, Iterative method, Time horizon, Optimization problem and Economic dispatch in his study of Metaheuristic.

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

Variable neighborhood search

N. Mladenović;P. Hansen.
Computers & Operations Research (1997)

4209 Citations

Variable neighborhood search: Principles and applications

Pierre Hansen;Nenad Mladenović.
European Journal of Operational Research (2001)

2324 Citations

Variable Neighborhood Search: Methods and Applications

Pierre Hansen;Nenad Mladenović;José A. Moreno Pérez.
Les Cahiers du GERAD (2008)

972 Citations

Variable neighbourhood search: methods and applications

Pierre Hansen;Nenad Mladenović;José A. Moreno Pérez.
Annals of Operations Research (2010)

757 Citations

An introduction to variable neighborhood search

Pierre Hansen;Nenad Mladenović.
MIC-97 : meta-heuristics international conference (1999)

563 Citations

Variable neighborhood search for the p-median

P. Hansen;N. Mladenović.
Location Science (1997)

523 Citations

The p-median problem: A survey of metaheuristic approaches

Nenad Mladenović;Jack Brimberg;Pierre Hansen;José A. Moreno-Pérez.
European Journal of Operational Research (2007)

480 Citations

Variable Neighborhood Search

Jack Brimberg;Pierre Hansen;Nenad Mladenović;José A. Moreno Pérez.
Les Cahiers du GERAD (2009)

428 Citations

Variable Neighborhood Decomposition Search

Pierre Hansen;Nenad Mladenović;Dionisio Perez-Britos.
Journal of Heuristics (2001)

423 Citations

J-Means: a new local search heuristic for minimum sum of squares clustering

Pierre Hansen;Nenad Mladenović.
Pattern Recognition (2001)

352 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 Nenad Mladenović

Günther R. Raidl

Günther R. Raidl

TU Wien

Publications: 69

Panos M. Pardalos

Panos M. Pardalos

University of Florida

Publications: 50

Pierre Hansen

Pierre Hansen

HEC Montréal

Publications: 49

Leo Liberti

Leo Liberti

École Polytechnique

Publications: 43

Jin-Kao Hao

Jin-Kao Hao

University of Angers

Publications: 43

Yannis Marinakis

Yannis Marinakis

Technical University of Crete

Publications: 42

Said Salhi

Said Salhi

University of Kent

Publications: 41

Karl F. Doerner

Karl F. Doerner

University of Vienna

Publications: 40

Gilbert Laporte

Gilbert Laporte

HEC Montréal

Publications: 38

Quan-Ke Pan

Quan-Ke Pan

Northeastern University

Publications: 33

Richard F. Hartl

Richard F. Hartl

University of Vienna

Publications: 33

Kenneth Sörensen

Kenneth Sörensen

University of Antwerp

Publications: 33

Edmund K. Burke

Edmund K. Burke

University of Leicester

Publications: 31

Thomas Stützle

Thomas Stützle

Université Libre de Bruxelles

Publications: 30

Christian Blum

Christian Blum

Spanish National Research Council

Publications: 29

Something went wrong. Please try again later.