Abstract: Backtracking combined with branching heuristics is a prevalent approach for tackling constraint satisfaction problems (CSPs) and combinatorial optimization problems (COPs). While branching ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results