Constraints Optimization Problems-COPs Academic Article uri icon

abstract

  • The general scheme of the algorithm is presented in Algorithm 3. 1, and is based on the pseudo-code given in [36]. X is the set of all variables, D is the set of all domains, C is the set of all constraints, PA (t) is the current partial assignment, LB is the lower bound, and UB is the upper bound. In the first

publication date

  • January 1, 2008