Using local search to speed up filtering algorithms for some NP-hard constraints

DOI10.1007/s10479-010-0715-0zbMath1223.05071OpenAlexW1998193115MaRDI QIDQ545546

Sandrine Paroz, Gilles Pesant, Philippe Galinier, Alain Hertz

Publication date: 22 June 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0715-0

zbMATH Keywords

local searchgraph coloringconstraint programming

Mathematics Subject Classification ID

Searching and sorting (68P10) Coloring of graphs and hypergraphs (05C15)

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• Precoloring extension. I: Interval graphs
• Generalized coloring for tree-like graphs
• Generalizing AllDifferent: The SomeDifferent Constraint
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Using local search to speed up filtering algorithms for some NP-hard constraints