Approximating the Incremental Knapsack Problem.
Federico Della CroceUlrich PferschyRosario ScatamacchiaPublished in: CoRR (2018)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- dynamic programming
- optimization problems
- test problems
- np hard
- linear programming relaxation
- np hard problems
- exact algorithms
- incremental learning
- greedy algorithm
- bicriteria
- multidimensional knapsack problem
- heuristic solution
- randomly generated test instances
- multiple objectives
- implicit enumeration
- maximum profit
- decision variables
- cutting plane
- network design
- constraint programming
- multistage