Since we attempt to order a set of sentences, the operation is regarded as solving the Traveling Salesman Problem; that is, we locate the path that offers maximum score through all n sentences as s 0 and s n+1 are starting and ending points, respectively.
the operation is NP-hard and it is difficult to find the global optimal solution.