Comparative analysis of linear programming relaxations for the robust knapsack problem.
Seulgi JoungSeyoung OhKyungsik LeePublished in: Ann. Oper. Res. (2023)
Keyphrases
- knapsack problem
- comparative analysis
- linear programming relaxation
- optimal solution
- cutting plane
- combinatorial optimization problems
- optimization problems
- dynamic programming
- exact algorithms
- np hard
- linear programming
- multidimensional knapsack problem
- greedy algorithm
- binary variables
- greedy heuristic
- lower bound
- implicit enumeration
- continuous relaxation
- production planning
- semi quantitative
- feasible solution
- maximum profit
- special case
- objective function
- multi objective
- evolutionary algorithm