Handbook of Constraints Programming——Chapter4 Backtracking Search Algorithms-Branching Strategies
来源:F.Rossi, P.Van Beek, T. Walsh. Handbook of Constraints Programming. Elsevier, 2006.
4.2 Branching Strategies
In the naive backtracking algorithm (BT), a node p = {x1 = a1, . . . , xj =