2 -Way vs.d -Way Branching for CSP
From MaRDI portal
Publication:3524188
DOI10.1007/11564751_27zbMath1153.68465OpenAlexW1602008100MaRDI QIDQ3524188
Publication date: 9 September 2008
Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11564751_27
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
Revisiting restricted path consistency ⋮ Exact Max-SAT solvers for over-constrained problems ⋮ Reasoning from last conflict(s) in constraint programming ⋮ Constraint-Level Advice for Shaving ⋮ Present and Future of Practical SAT Solving
This page was built for publication: 2 -Way vs.d -Way Branching for CSP
