Login / Signup

A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model.

Yi-Shuai NiuYu YouWenxu XuWentao DingJunpeng HuSongquan Yao
Published in: Optim. Lett. (2021)
Keyphrases
  • branch and bound
  • search space
  • branch and bound procedure
  • upper bound
  • optimal solution
  • probabilistic model
  • linear programming
  • convex programming
  • lower bound
  • text classification
  • structured data