Tree decomposition method combined with separator in constraint satisfaction problems

DOI10.13413/J.CNKI.JDXBLXB.2016.02.25MaRDI QIDQ2990573zbMATH OpenFDO

Authors Wei Lü, Shujuan Zhang

Publication date 10 August 2016

zbMATH Keywords

artificial intelligenceconstraint satisfaction problemtree decompositionheuristic methodbacktracking search

Mathematics Subject Classification ID

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

Recommendations

• Combining restarts, nogoods and bag-connected decompositions for solving csps
• Hybrid backtracking bounded by tree-decomposition of constraint networks
• Combining restarts, nogoods and decompositions for solving CSPs
• Recent Advances in Constraints
• Bounded backtracking for the valued constraint satisfaction problems

Cited in

(4)

• Combining tree partitioning, precedence, and incomparability constraints
• Hybrid backtracking bounded by tree-decomposition of constraint networks
• Combining restarts, nogoods and bag-connected decompositions for solving csps
• Combining restarts, nogoods and decompositions for solving CSPs

This page was built for publication: Tree decomposition method combined with separator in constraint satisfaction problems

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