Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems

DOI10.1007/11493853_26zbMath1133.68437OpenAlexW1608303670MaRDI QIDQ5450944

Sathiamoorthy Subbarayan

Publication date: 17 March 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/11493853_26

Mathematics Subject Classification ID

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

Related Items (2)

Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams ⋮ Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem

Uses Software

• BuDDy

This page was built for publication: Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems