Interleaving Constraint Propagation: An Efficient Cooperative Search with Branch and Bound

doi:https://doi.org/10.1007/978-3-642-38516-2_5

Book Chapter10.1007/978-3-642-38516-2_5

Interleaving Constraint Propagation: An Efficient Cooperative Search with Branch and Bound

Éric Monfroy,Broderick Crawford,Ricardo Soto-2013-01-01-Lecture notes in computer science

1

Chat with Paper

AI Agents for this Paper

No abstract available for this paper.

Keywords

Local consistencyConstraint (computer-aided design)Binary constraintInterleavingHybrid algorithm (constraint satisfaction)Constraint satisfaction problemSearch treeConstraint satisfaction

Chat

Click to start Chat