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.
