“…The separation on the node (3, 1) of level 1 (L1) will provide in level 2 (L2) the following partial solution border positions: 𝑆 = {(2, 1); (2, 2); (3, 3); (4, 1)}. We observe in level 2 (L2) a partial solution equal to (3, 1); (2,2) which is equal to the partial solution (3, 1); (2, 2) already treated. Hence, the elimination of the (2, 2) sensor position from the remaining position of the node (3, 1) in the first level of the search tree will improve the performance of the B&B algorithm in terms of fathomed nodes and computation time.…”