P. Hansen

Publications483
h-index72
Citations25,581
Highly Influential Citations1,599
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • N. Mladenović
  • 292 Publications • 18,974 Citations
  • P. Hammer
  • 295 Publications • 11,389 Citations
  • I. Gutman
  • 1,108 Publications • 32,481 Citations
  • B. Jaumard
  • 404 Publications • 6,658 Citations
  • Publications
  • Influence
Variable neighborhood search
View via Publisher
Variable neighborhood search: Principles and applications
View via Publisher
NP-hardness of Euclidean sum-of-squares clustering
A recent proof of NP-hardness of Euclidean sum-of-squares clustering, due to Drineas et al. (Mach. Learn. 56:9–33, 2004), is not valid. An alternate short proof is provided.
View on Springer
Variable Neighborhood Search
View via Publisher
Bicriterion Path Problems
TLDR
Algorithms are provided for some of the bicriterion path problems in directed graphs, including polynomial algorithms for the MAXMIN-MAXMIN problem and the MINSUM-MAX MIN problem, and a pseudo-polynomial exact algorithm as well as a fullyPolynomial approximation scheme for the MINsUM-MINSUM problem.
View via Publisher
Variable neighborhood search for the p-median
View via Publisher
Variable neighbourhood search: methods and applications
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in…
View on Springer
Variable Neighbourhood Search
The basic idea of VNS is the change of neighbourhoods in the search for a better solution. VNS proceeds by a descent method to a local minimum exploring then, systematically or at random,…
View via Publisher
Roof duality, complementation and persistency in quadratic 0–1 optimization
TLDR
The main result is that the four gaps associated with the four relaxations are equal, and a class of gap-free functions (properly including the supermodular ones) is exhibited.
View on Springer
An Introduction to Variable Neighborhood Search
TLDR
A relatively unexplored approach to the design of heuristics, the guided change of neighborhood in the search process, is examined, which leads to a new metaheuristic, which is widely applicable.
View via Publisher
...
...