Maximizing a monotone non-submodular function under a knapsack constraint.
Zhenning ZhangBin LiuYishui WangDachuan XuDongmei ZhangPublished in: J. Comb. Optim. (2022)
Keyphrases
- submodular functions
- greedy algorithm
- facility location problem
- knapsack problem
- dynamic programming
- energy function
- combinatorial optimization
- objective function
- convex optimization
- upper bound
- worst case
- approximation algorithms
- optimal solution
- linear programming
- feasible solution
- packing problem
- genetic algorithm
- pairwise
- training set
- facility location