Maximization of Monotone Non-submodular Functions with a Knapsack Constraint over the Integer Lattice.
Jingjing TanFengmin WangXiaoqing ZhangYang ZhouPublished in: COCOA (2021)
Keyphrases
- submodular functions
- greedy algorithm
- objective function
- knapsack problem
- integer variables
- facility location problem
- integer points
- energy function
- dynamic programming
- convex optimization
- feasible solution
- diminishing returns
- upper bound
- combinatorial optimization
- optimal solution
- branch and bound
- higher order
- lower bound
- branch and bound algorithm
- theoretical guarantees
- convex hull
- cost function
- active learning