An efficient branch-and-cut algorithm for approximately submodular function maximization.

Naoya Uematsu Shunji Umetani Yoshinobu Kawahara

Published in: CoRR (2019)

Keyphrases

objective function
learning algorithm
computational complexity
dynamic programming
worst case
optimal solution
pairwise
optimization problems
particle swarm optimization
lower and upper bounds
decision trees
search space
cost function
probabilistic model
mathematical model