Reduction strategies for the Cardinality Constrained Knapsack problem.
Krzysztof PienkoszPublished in: MMAR (2017)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- test problems
- optimal solution
- dynamic programming
- optimization problems
- exact algorithms
- heuristic solution
- greedy algorithm
- linear programming relaxation
- np hard problems
- bicriteria
- multidimensional knapsack problem
- np hard
- cutting plane
- greedy heuristic
- continuous relaxation
- decision variables
- search strategies
- maximum profit
- neural network
- multiple objectives
- lower bound
- online auctions
- integer variables