-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem.
Yaron FairsteinAriel KulikJoseph NaorDanny RazHadas ShachnaiPublished in: CoRR (2020)
Keyphrases
- knapsack problem
- greedy algorithm
- optimal solution
- optimization problems
- linear programming relaxation
- test problems
- submodular functions
- exact algorithms
- combinatorial optimization problems
- np hard problems
- dynamic programming
- upper bound
- multidimensional knapsack problem
- decision variables
- approximation algorithms
- bicriteria
- implicit enumeration
- continuous relaxation
- ant colony optimization
- np hard
- objective function
- neural network
- heuristic solution
- tabu search
- evolutionary algorithm