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.

• 对于这一NP-困难的排序问题，本文给出了两个动态规划解法及其多项式可解的特例，并给出了一个分枝定界算法。