Pierre Hansen

Geometry and Topology · 1984–2018

A researcher in the Science corpus: 19 papers; trusts 18 researchers and is trusted by 25 researchers here, as inferred from the citation graph.

Subfields

• Geometry and Topology — 40 citations into it; #4,021 of 7,422 by trust here, #2,575 by citations
• Computational Theory and Mathematics — 31 citations into it; #10,053 of 12,182 by trust here, #6,463 by citations
• Organic Chemistry — 18 citations into it; #450 of 1,495 by trust here, #1,089 by citations
• Industrial and Manufacturing Engineering — 15 citations into it; #1,031 of 2,521 by trust here, #1,691 by citations
• Artificial Intelligence — 8 citations into it; #19,148 of 35,345 by trust here, #14,718 by citations
• Computer Vision and Pattern Recognition — 8 citations into it; #8,716 of 21,575 by trust here, #9,722 by citations
• Numerical Analysis — 5 citations into it; #2,942 of 3,586 by trust here, #3,457 by citations

Whom Pierre Hansen trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Dragos M. Cvetkovic
2. Gerhard Reinelt
3. Mustapha Aouchiche
4. Nenad Mladenovic
5. Fred W. Glover
6. Philip E. Gill
7. David S. Johnson
8. Slobodan K. Simic
9. Maurício Resende
10. Peter Rowlinson

Who trusts Pierre Hansen overall

1. Haroldo Gambini Santos
2. Mustapha Aouchiche
3. J. Framiñán
4. Nenad Mladenovic
5. S. Bonhomme
6. Rainer Kolisch
7. Stefan Røpke
8. Varun Ojha
9. Vladimir Kolmogorov
10. Vinod Nair

Papers from Pierre Hansen's perspective

Ordered by how strongly the researchers Pierre Hansen trusts endorse each paper. Same corpus, a different order for every researcher.

1. The NP-Completeness Column: An Ongoing Guide
2. In Modern Heuristic Techniques for Combinatorial Problems
3. The Cutting-Plane Method for Solving Convex Programs
4. SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization (SIAM Journal on Optimization)
5. A Hybrid Heuristic for the p-Median Problem (J. Heuristics)
6. Algebraic connectivity of graphs
7. TSPLIB - A Traveling Salesman Problem Library
8. Variable neighborhood search (European Journal of Operational Research)
9. Bounds on graph eigenvalues I
10. The volume algorithm: producing primal solutions with a subgradient method (Mathematical programming)

Their papers

• Variable neighborhood search (2008) — 1,492 citations
• Bounds and conjectures for the signless Laplacian index of graphs (2009) — 55 citations
• Two Laplacians for the distance matrix of a graph (2011) — 271 citations
• On the spectral radius of graphs with a given domination number (2007) — 55 citations
• Some properties of the distance Laplacian eigenvalues of a graph (2013) — 87 citations
• Variable Neighborhood Search (2018)
• Variable neighborhood search: basics and variants (2017) — 350 citations
• On the distance signless Laplacian of a graph (2014) — 60 citations
• Distance spectra of graphs: A survey (2013) — 348 citations
• Variable neighbourhood search: methods and applications (2010) — 592 citations
• Comparing Zagreb Indices of Cyclic Graphs (2009) — 52 citations
• NP-hardness of Euclidean sum-of-squares clustering (2008) — 1,037 citations
• Comparing the Zagreb Indices (2007) — 104 citations
• Essays and surveys in global optimization (2005) — 83 citations
• The p-median problem: A survey of metaheuristic approaches (2005) — 468 citations
• Variable Neighbourhood Search (2003) — 438 citations
• Essays and Surveys in Metaheuristics (2002) — 319 citations
• New Branch-and-Bound Rules for Linear Bilevel Programming (1989)
• Roof duality, complementation and persistency in quadratic 0–1 optimization (1984)