An efficient branch-and-bound algorithm for submodular function maximization.
Naoya UematsuShunji UmetaniYoshinobu KawaharaPublished in: CoRR (2018)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- submodular functions
- lower bound
- branch and bound
- optimal solution
- objective function
- lower bounding
- upper bound
- np hard
- greedy algorithm
- precedence constraints
- single machine scheduling problem
- upper bounding
- mixed integer linear programming
- randomly generated problems
- lagrangian relaxation
- metaheuristic
- optimization problems
- search algorithm
- simulated annealing
- finding an optimal solution
- facility location problem
- integer programming
- machine learning
- multi objective
- energy function
- supervised learning