The {0, 1}-knapsack problem with qualitative levels.
Luca E. SchäferTobias DietzMaria BarbatiJosé Rui FigueiraSalvatore GrecoStefan RuzikaPublished in: CoRR (2020)
Keyphrases
- knapsack problem
- optimization problems
- combinatorial optimization problems
- test problems
- dynamic programming
- exact algorithms
- optimal solution
- np hard
- multidimensional knapsack problem
- bicriteria
- np hard problems
- maximum profit
- continuous relaxation
- linear programming relaxation
- cutting plane
- greedy heuristic
- evolutionary algorithm
- heuristic solution
- greedy algorithm
- implicit enumeration
- multiple objectives
- vehicle routing problem
- simulated annealing
- integer variables
- upper bound