Embarrassingly parallel search in constraint programming

DOI10.1613/JAIR.5247MaRDI QIDQ2953936zbMATH OpenOpenAlexFDO

Authors Arnaud Malapert, Jean-Charles Régin, Mohamed Ali Rezgui

Publication date 11 January 2017

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.5247

zbMATH Keywords

constraint programmingparallel constraint solving

Mathematics Subject Classification ID

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

Recommendations

• Improving the robustness of EPS to solve the TSP
• A review of literature on parallel constraint solving
• Transparent parallelization of constraint programming
• Parallelizing constraint programming with learning
• Large-scale parallelism for constraint-based local search: the costas array case study

Cited in

(10)

• A tagging method for parallel constraint satisfaction
• \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
• Improving the robustness of EPS to solve the TSP
• A subdivision algorithm to reason on high-degree polynomial constraints over finite domains
• Large-scale parallelism for constraint-based local search: the costas array case study
• Parallelizing constraint programming with learning
• Transparent parallelization of constraint programming
• A 44-element mesh of Schneiders' pyramid
• A review of literature on parallel constraint solving
• Logic Programming

This page was built for publication: Embarrassingly parallel search in constraint programming

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