To deal with such an NP-hard problem, the paper proposes two dynamic programming algorithms, a branch and bound algorithm with a polynomial solvable case.