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

DOI10.1007/978-3-540-68155-7_26MaRDI QIDQ5387639zbMATH OpenOpenAlexFDO

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

Publication date 27 May 2008

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68155-7_26

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Using local search to speed up filtering algorithms for some NP-hard constraints
• scientific article; zbMATH DE number 2159467
• Global Constraints: A Survey
• Local Search and Constraint Programming
• scientific article; zbMATH DE number 1008453

Cites work

• A characterization of uniquely 2-list colorable graphs
• Approximated consistency for knapsack constraints
• Generalized coloring for tree-like graphs
• Generalizing AllDifferent: The SomeDifferent Constraint
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Precoloring extension. I: Interval graphs
• Using tabu search techniques for graph coloring

Cited in

(3)

• FM SCREENING BY THE LOCAL EXHAUSTIVE SEARCH, WITH HARDWARE ACCELERATION
• Using local search to speed up filtering algorithms for some NP-hard constraints
• Principles and Practice of Constraint Programming – CP 2004

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 Q5387639)