Distributed Constraint Optimization Problems (DisCOPs) Academic Article uri icon


  • 14.2 Synchronous Branch and Bound (SBB) 161 pseudo-tree ordering [20] is a tree ordering with the following unique property. If two agents share a constraint, then one of these agents is an ancestor of the other. This means that all constraints are either from parent to son (tree edges), or from an agent to one of its ancestors (back edges). Pseudo-trees are useful for solving COPs because they allow splitting the problem into several smaller subproblems, solving the subproblems independently, and then merging the solution into a global …

publication date

  • January 1, 2008