A spatial branch-and-bound approach for maximization of differentiable monotone continuous submodular functions
A new method for finding globally maximal solutions for differentiable non-decreasing continuous submodular functions subject to constraints is proposed and a cutting plane algorithm that finds approximate solutions and bounds using an approximation of the convex hull of the hypograph is developed.