An optimal backtrack algorithm for tree-structured constraint satisfaction problems

DOI10.1016/0004-3702(94)90064-7zbMath0938.68828OpenAlexW1979944023MaRDI QIDQ1341668

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)

Related Items

Hybrid backtracking bounded by tree-decomposition of constraint networks

Cites Work

• Unnamed Item
• Network-based heuristics for constraint-satisfaction problems
• Consistency in networks of relations
• Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
• A Sufficient Condition for Backtrack-Free Search