Sciweavers

Share
CPAIOR
2008
Springer

Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints

9 years 8 months ago
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally expensive. Local search quickly provides supports for many variable-value pairs, thus reducing the effort required to check and potentially filter the rest of them. The idea is demonstrated on the SomeDifferent constraint, a graph coloring substructure. An experimental evaluation confirms its significant computational gain in many cases.
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gi
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where CPAIOR
Authors Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant
Comments (0)
books