The Incremental Knapsack Problem with Monotone Submodular All-or-Nothing Profits.
Federico D'OnofrioYuri FaenzaLingyi ZhangPublished in: CoRR (2023)
Keyphrases
- knapsack problem
- greedy algorithm
- submodular functions
- combinatorial optimization problems
- optimal solution
- optimization problems
- np hard
- dynamic programming
- test problems
- bicriteria
- linear programming relaxation
- heuristic solution
- multidimensional knapsack problem
- np hard problems
- objective function
- multiple objectives
- greedy heuristic
- upper bound
- search algorithm
- implicit enumeration
- exact algorithms
- worst case
- special case
- continuous relaxation