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

DOI10.1007/S10479-010-0715-0MaRDI QIDQ545546zbMATH OpenOpenAlexFDO

Authors P. Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant

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 searchconstraint programminggraph coloring

Mathematics Subject Classification ID

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

Recommendations

• Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
• Local Search and Constraint Programming
• Domain filtering consistencies
• Local search with constraint propagation and conflict-based heuristics
• Using Local Search for Guiding Enumeration in Constraint Solving

Cites work

• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A characterization of uniquely 2-list colorable graphs
• Approximated consistency for knapsack constraints
• Generalized coloring for tree-like graphs
• Generalizing AllDifferent: The SomeDifferent Constraint
• Precoloring extension. I: Interval graphs
• Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
• Using tabu search techniques for graph coloring

Cited in

(5)

• Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
• FM SCREENING BY THE LOCAL EXHAUSTIVE SEARCH, WITH HARDWARE ACCELERATION
• Accelerating filtering techniques for numeric CSPs
• Filtering algorithms for the NValue constraint
• Filtering Algorithms for the NValue Constraint

Describes a project that uses

Uses Software

• Tabu search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545546)