An optimal backtrack algorithm for tree-structured constraint satisfaction problems

DOI10.1016/0004-3702(94)90064-7MaRDI QIDQ1341668zbMATH OpenOpenAlexFDO

Authors Roberto J. jun. Bayardo, Daniel P. Miranker

Publication date 21 June 2000

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0004-3702(94)90064-7

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• A Sufficient Condition for Backtrack-Free Search
• Consistency in networks of relations
• Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
• Network-based heuristics for constraint-satisfaction problems

Cited in

(2)

• TreeTracker Join: simple, optimal, fast
• Hybrid backtracking bounded by tree-decomposition of constraint networks

This page was built for publication: An optimal backtrack algorithm for tree-structured constraint satisfaction problems

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