H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Mathematics H-index 77 Citations 30,200 359 World Ranking 68 National Ranking 5
Computer Science H-index 70 Citations 27,350 313 World Ranking 803 National Ranking 31

Research.com Recognitions

Awards & Achievements

1986 - EURO Gold Medal

Overview

What is he best known for?

The fields of study he is best known for:

  • Mathematical optimization
  • Algorithm
  • Statistics

His main research concerns Mathematical optimization, Variable neighborhood search, Metaheuristic, Algorithm and Heuristics. His Mathematical optimization research focuses on Tabu search, Local optimum, Branch and bound, Integer programming and Linear programming. His Variable neighborhood search study combines topics in areas such as Discrete mathematics, Graph theory, Combinatorics, Local search and Heuristic.

His Metaheuristic research incorporates elements of Global optimization, Travelling salesman problem, Social science, Combinatorial optimization and Search algorithm. Pierre Hansen interconnects Column generation, Function, Explained sum of squares and Cluster analysis in the investigation of issues within Algorithm. Moment-generating function is closely connected to Heuristic in his research, which is encompassed under the umbrella topic of Heuristics.

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?

Pierre Hansen mainly investigates Combinatorics, Mathematical optimization, Discrete mathematics, Variable neighborhood search and Algorithm. His Combinatorics study typically links adjacent topics like Upper and lower bounds. His is doing research in Heuristics, Global optimization, Heuristic, Tabu search and Quadratic programming, both of which are found in Mathematical optimization.

His Discrete mathematics study frequently links to adjacent areas such as Graph. His Variable neighborhood search research integrates issues from Local search and Heuristic. His Algorithm study integrates concerns from other disciplines, such as Column generation, Explained sum of squares and Cluster analysis.

He most often published in these fields:

  • Combinatorics (45.26%)
  • Mathematical optimization (29.08%)
  • Discrete mathematics (29.39%)

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

  • Combinatorics (45.26%)
  • Discrete mathematics (29.39%)
  • Mathematical optimization (29.08%)

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

His scientific interests lie mostly in Combinatorics, Discrete mathematics, Mathematical optimization, Cluster analysis and Connectivity. His Combinatorics study which covers Eigenvalues and eigenvectors that intersects with Graph. The Discrete mathematics study combines topics in areas such as Graph theory and Partition.

His work in Mathematical optimization addresses issues such as Modularity maximization, which are connected to fields such as Theoretical computer science. His biological study deals with issues like Algorithm, which deal with fields such as Column generation. His Variable neighborhood search study necessitates a more in-depth grasp of Metaheuristic.

Between 2010 and 2021, his most popular works were:

  • A survey of Nordhaus-Gaddum type relations (148 citations)
  • Distance spectra of graphs: A survey (146 citations)
  • Two Laplacians for the distance matrix of a graph (127 citations)

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

  • Statistics
  • Algorithm
  • Mathematical optimization

The scientist’s investigation covers issues in Combinatorics, Mathematical optimization, Discrete mathematics, Cluster analysis and Connectivity. His study in Mathematical optimization concentrates on Variable neighborhood search, Heuristics, Global optimization, Branch and bound and Combinatorial optimization. His Variable neighborhood search research is within the category of Metaheuristic.

Discrete mathematics is frequently linked to Partition in his study. His work focuses on many connections between Cluster analysis and other disciplines, such as Expected value, that overlap with his field of interest in Degree distribution, Computational intelligence and Modularity. His Connectivity research incorporates themes from Eigenvalues and eigenvectors, Spectral radius, Complete graph and Laplace operator.

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

NP-hardness of Euclidean sum-of-squares clustering

Daniel Aloise;Amit Deshpande;Pierre Hansen;Preyas Popat.
Machine Learning (2009)

888 Citations

Variable neighbourhood search: methods and applications

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

757 Citations

Cluster analysis and mathematical programming

Pierre Hansen;Brigitte Jaumard.
Mathematical Programming (1997)

753 Citations

Bicriterion Path Problems

Pierre Hansen.
(1980)

670 Citations

New branch-and-bound rules for linear bilevel programming

Pierre Hansen;Brigitte Jaumard;Gilles Savard.
Siam Journal on Scientific and Statistical Computing (1992)

666 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

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 Pierre Hansen

Nenad Mladenović

Nenad Mladenović

Khalifa University of Science and Technology

Publications: 130

Panos M. Pardalos

Panos M. Pardalos

University of Florida

Publications: 81

Ivan Gutman

Ivan Gutman

University of Kragujevac

Publications: 74

Günther R. Raidl

Günther R. Raidl

TU Wien

Publications: 71

Gilbert Laporte

Gilbert Laporte

HEC Montréal

Publications: 51

Said Salhi

Said Salhi

University of Kent

Publications: 50

Zvi Drezner

Zvi Drezner

California State University, Fullerton

Publications: 44

Leo Liberti

Leo Liberti

École Polytechnique

Publications: 43

Yannis Marinakis

Yannis Marinakis

Technical University of Crete

Publications: 42

Karl F. Doerner

Karl F. Doerner

University of Vienna

Publications: 42

Fred Glover

Fred Glover

University of Colorado Boulder

Publications: 40

Thomas Stützle

Thomas Stützle

Université Libre de Bruxelles

Publications: 38

Bo Zhou

Bo Zhou

South China Normal University

Publications: 38

Christodoulos A. Floudas

Christodoulos A. Floudas

Texas A&M University

Publications: 36

Celso C. Ribeiro

Celso C. Ribeiro

Fluminense Federal University

Publications: 35

Something went wrong. Please try again later.