The polynomial robust knapsack problem.
Alessandro BaldoMatteo BoffaLorenzo CascioliEdoardo FaddaChiara LanzaArianna RaveraPublished in: Eur. J. Oper. Res. (2023)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- optimization problems
- multidimensional knapsack problem
- exact algorithms
- heuristic solution
- dynamic programming
- linear programming relaxation
- np hard
- test problems
- bicriteria
- np hard problems
- greedy heuristic
- decision variables
- multiple objectives
- greedy algorithm
- continuous relaxation
- genetic algorithm
- maximum profit
- upper bound
- multi objective
- objective function