Galinier Philippe

Philippe Galinier

Information about the author Philippe Galinier will soon be added to the site.
Found 7 papers in total
Restricted swap-based neighborhood search for the minimum connected dominating set problem
Restricted swap-based neighborhood search for the minimum connected dominating set problem
2017
The minimum connected dominating set problem (MCDSP) has become increasingly important...
A tabu search algorithm for the covering design problem
A tabu search algorithm for the covering design problem
2011
A ( v , k , t )‐covering design is a collection of k ‐subsets (called...
An efficient memetic algorithm for the graph partitioning problem
An efficient memetic algorithm for the graph partitioning problem
2011
Given a graph and an integer k , the goal of the graph partitioning problem is to find...
Using local search to speed up filtering algorithms for some NP‐hard constraints
Using local search to speed up filtering algorithms for some NP‐hard constraints
2011
This paper proposes to use local search inside filtering algorithms of combinatorial...
A survey of local search methods for graph coloring
A survey of local search methods for graph coloring
2006
Tabucol is a tabu search algorithm that tries to determine whether the vertices of a...
A Tabu Search algorithm for difference triangle sets and Golomb rulers
A Tabu Search algorithm for difference triangle sets and Golomb rulers
2006
We propose a Tabu Search heuristic to design optimal Golomb rulers and Difference...
A general approach for constraint solving by local search
A general approach for constraint solving by local search
2004
In this paper, we present a general approach for solving constraint problems by local...
Papers per page: