YIELDS: A Yet Improved Limited Discrepancy Search for CSPs

DOI10.1007/978-3-540-72397-4_8MaRDI QIDQ3612410zbMATH OpenOpenAlexFDO

Authors Wafa Karoui, Marie-José Huguet, Pierre Lopez, Wady Naanaa

Publication date 10 March 2009

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-72397-4_8

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Limited discrepancy search revisited
• A decomposition-based implementation of search strategies
• Evaluating and improving modern variable and revision ordering strategies in CSPs
• Parallel depth-bounded discrepancy search
• scientific article; zbMATH DE number 1437203

Cited in

(6)

• Weight-based heuristics for constraint satisfaction and combinatorial optimization problems
• Search for combinatorial objects using lattice algorithms -- revisited
• Variable neighborhood search for graphical model energy minimization
• YIELDS
• A decomposition-based implementation of search strategies
• Limited discrepancy search revisited

This page was built for publication: YIELDS: A Yet Improved Limited Discrepancy Search for CSPs

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