We are: (1) selecting a subset of candidate phrases, and (2) re-ordering the selected phrases (hence making the problem NP-hard).
we encode our problem using Integer Linear Programming (ILP) (Roth and tau Yih, 2004;Clarke and Lapata, 2008) and use the CPLEX (ILOG, Inc, 2006) solver.