Maximizing JSD can not be solved exactly with an ILP because it can not be factorized into individual sentences.
applying an efficient greedy algorithm or maximizing a factorizable relaxation might produce strong results as well (for example, a simple greedy maximization of Kullback-Leibler divergence already yields good results (Haghighi and Vanderwende, 2009)).