Parallel depth-bounded discrepancy search

DOI10.1007/978-3-319-07046-9_27MaRDI QIDQ5418744zbMATH OpenOpenAlexFDO

Authors Thierry Moisan, Claude-Guy Quimper, Jonathan Gaudreault

Publication date 27 May 2014

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

Full work available at URL https://doi.org/10.1007/978-3-319-07046-9_27

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40)

Recommendations

• Limited discrepancy search revisited
• A decomposition-based implementation of search strategies
• scientific article; zbMATH DE number 1760141
• On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
• Space-Efficient Parallel Algorithms for Combinatorial Search Problems

Cited in

(9)

• Parallel depth first search. I: Implementation
• Constraint-directed search for all-interval series
• Large-scale parallelism for constraint-based local search: the costas array case study
• Scalable Parallel DFPN Search
• YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
• scientific article; zbMATH DE number 1760141 (Why is no real title available?)
• scientific article; zbMATH DE number 865205 (Why is no real title available?)
• A decomposition-based implementation of search strategies
• Limited discrepancy search revisited

This page was built for publication: Parallel depth-bounded discrepancy search

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