-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem.
Yaron FairsteinAriel KulikJoseph (Seffi) NaorDanny RazHadas ShachnaiPublished in: ESA (2020)
Keyphrases
- knapsack problem
- greedy algorithm
- combinatorial optimization problems
- optimal solution
- np hard
- bicriteria
- linear programming relaxation
- submodular functions
- greedy heuristic
- dynamic programming
- test problems
- exact algorithms
- optimization problems
- continuous relaxation
- neural network
- multidimensional knapsack problem
- objective function
- decision variables
- cutting plane
- convex optimization
- random variables
- heuristic solution
- np hard problems
- upper bound
- search space