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

DOI10.1007/S10479-010-0715-0zbMATH Open1223.05071OpenAlexW1998193115MaRDI QIDQ545546FDOQ545546

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

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

zbMATH Keywords

local searchconstraint programminggraph coloring

Mathematics Subject Classification ID

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

Cites Work

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

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

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)