Traveling Salesperson Problem



Our branch-and-strategy splits a branch and bound solution into two groups:

one group including a particular arc and the other excluding this arc.

1.Each splitting incurs a lower bound and we shall traverse the searching tree with the "lower" lower bound.

2.If a constant subtracted from any row

or any column of the cost matrix, an

optimal solution does not change.