Hansen Pierre

Pierre Hansen

Information about the author Pierre Hansen will soon be added to the site.
Found 63 papers in total
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
2017
In a single local search algorithm, several neighborhood structures are usually...
Sequential clustering with radius and split criteria
Sequential clustering with radius and split criteria
2013
Sequential clustering aims at determining homogeneous and/or well‐separated...
Evaluating a branch‐and‐bound RLT‐based algorithm for minimum sum‐of‐squares clustering
Evaluating a branch‐and‐bound RLT‐based algorithm for minimum sum‐of‐squares clustering
2011
Minimum sum-of-squares clustering consists in partitioning a given set of n points...
Using size for bounding expressions of graph invariants
Using size for bounding expressions of graph invariants
2011
With the help of the AutoGraphiX system, we study relations of the form b ¯ m...
A new column generation algorithm for Logical Analysis of Data
A new column generation algorithm for Logical Analysis of Data
2011
We present a new column generation algorithm for the determination of a classifier in...
Globally optimal clusterwise regression by mixed logical‐quadratic programming
Globally optimal clusterwise regression by mixed logical‐quadratic programming
2011
Exact global optimization of the clusterwise regression problem is challenging and...
Attraction probabilities in variable neighborhood search
Attraction probabilities in variable neighborhood search
2010
Empirical evidence demonstrates that when the same local search operator is used,...
Variable neighbourhood search: methods and applications
Variable neighbourhood search: methods and applications
2010
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building...
Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille
Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille
2009
Using the AutoGraphiX 2 system (AGX2), we study relations between graph invariants.
Primal-dual variable neighborhood search for the simple plant-location problem
Primal-dual variable neighborhood search for the simple plant-location problem
2007
The variable neighborhood search metaheuristic is applied to the primal simple...
Variable neighbourhood search: methods and applications
Variable neighbourhood search: methods and applications
2008
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building...
The p-median problem: A survey of metaheuristic approaches
The p-median problem: A survey of metaheuristic approaches
2007
The p -median problem is one of the basic models in discrete location theory. As with...
Arbitrary-norm hyperplane separation by variable neighbourhood search
Arbitrary-norm hyperplane separation by variable neighbourhood search
2007
We consider the problem of separating two sets of points in a Euclidean space with a...
Variable neighbourhood search for colour image quantization
Variable neighbourhood search for colour image quantization
2007
Colour image quantization is a data compression technique that reduces the total set...
Decomposition strategies for large-scale continuous location–allocation problems
Decomposition strategies for large-scale continuous location–allocation problems
2006
The continuous location–allocation problem requires finding sites for m new...
Pooling problem: Alternate formulations and solution methods
Pooling problem: Alternate formulations and solution methods
2004
The pooling problem, which is fundamental to the petroleum industry, describes a...
Enumeration of all the extreme equilibria in game theory: Bimatrix and polymatrix games
Enumeration of all the extreme equilibria in game theory: Bimatrix and polymatrix games
2006
Bimatrix and polymatrix games are expressed as parametric linear 0–1 programs....
Variable neighborhood search and local branching
Variable neighborhood search and local branching
2006
In this paper we develop a variable neighborhood search (VNS) heuristic for solving...
A study of the variable neighbourhood of certain extreme graphs
A study of the variable neighbourhood of certain extreme graphs
2005
The AutoGraphiX system (AGX1 and AGX2) allows, among other functions, automated...
Permutation-based genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays
Permutation-based genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays
2005
The multiprocessor scheduling problem with communication delays that we consider in...
Heuristic procedures for solving the discrete ordered median problem
Heuristic procedures for solving the discrete ordered median problem
2005
We present two heuristic methods for solving the Discrete Ordered Median Problem...
On some interconnections between combinatorial optimization and extremal graph theory
On some interconnections between combinatorial optimization and extremal graph theory
2004
The uniting feature of combinatorial optimization and extremal graph theory is that in...
An exact method of fractional goal programming
An exact method of fractional goal programming
2004
Goal Programming with fractional objectives can be reduced to mathematical programming...
Cooperative parallel variable neighborhood search for the p-median
Cooperative parallel variable neighborhood search for the p-median
2004
We propose a cooperative multi-search method for the Variable Neighborhood Search...
Papers per page: