On approximating the Incremental Knapsack Problem.
Federico Della CroceUlrich PferschyRosario ScatamacchiaPublished in: Discret. Appl. Math. (2019)
Keyphrases
- lp relaxation
- knapsack problem
- dynamic programming
- combinatorial optimization problems
- optimal solution
- optimization problems
- test problems
- incremental learning
- exact algorithms
- multidimensional knapsack problem
- greedy algorithm
- np hard
- decision variables
- heuristic solution
- linear programming relaxation
- bicriteria
- multiple objectives
- greedy heuristic
- continuous relaxation