A new class of hard problem instances for the 0-1 knapsack problem.
Jorik JookenPieter LeymanPatrick De CausmaeckerPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- knapsack problem
- linear programming relaxation
- combinatorial optimization problems
- randomly generated test instances
- optimization problems
- exact algorithms
- optimal solution
- test problems
- dynamic programming
- bicriteria
- np hard
- cutting plane
- greedy heuristic
- multidimensional knapsack problem
- continuous relaxation
- heuristic solution
- greedy algorithm
- linear programming
- randomly generated
- branch and bound algorithm
- np hard problems