CSP (constraint satisfactory problem) has the advantage of solving complicated constraints to obtain satisfying solutions, but does not guarantee the quality of the solution. In contrast, OR (operation research) has the advantage of obtaining optimization solution or near optimization solution. But it is very difficult to solve the optimization problems with complicated constraints. CPT (constraint propagation technique) is the main search approach of CSP. BAB (branch_and_bound) is one of the optimization a...