Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
From MaRDI portal
Publication:5387639
DOI10.1007/978-3-540-68155-7_26zbMath1142.68511OpenAlexW1617540954MaRDI QIDQ5387639
Alain Hertz, Gilles Pesant, Philippe Galinier, Sandrine Paroz
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Cites Work
- 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
- Principles and Practice of Constraint Programming – CP 2003
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems