An Efficient Branch-and-Cut Algorithm for Approximately Submodular Function Maximization.

Naoya Uematsu Shunji Umetani Yoshinobu Kawahara

Published in: SMC (2019)

Keyphrases

objective function
optimal solution
computational complexity
simulated annealing
np hard
dynamic programming
combinatorial optimization
worst case
learning algorithm
cost function
search space
linear programming
particle swarm optimization
convex hull
greedy algorithm
lower bound
theoretical guarantees