Branch \& Sample: A simple strategy for constraint satisfaction

DOI10.1007/BF02219227zbMath0677.68102OpenAlexW2052729468MaRDI QIDQ1123646

Per Galle

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02219227

zbMATH Keywords

constraint satisfactionbacktrackingsimilarity functionautomated designcombinatorial explosion

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99) Artificial intelligence (68T99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem, Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory

Cites Work

• Unnamed Item
• Unnamed Item
• General branch and bound, and its relation to \(A^*\) and \(AO^*\)
• Consistency in networks of relations
• A sufficient condition for backtrack-bounded search
• A Sufficient Condition for Backtrack-Free Search
• Combinatorially implosive algorithms
• Backtrack programming techniques
• Branch-and-Bound Methods: A Survey