Approximating the product knapsack problem.
Ulrich PferschyJoachim SchauerClemens ThielenPublished in: Optim. Lett. (2021)
Keyphrases
- knapsack problem
- production planning
- combinatorial optimization problems
- optimization problems
- test problems
- optimal solution
- exact algorithms
- np hard
- linear programming relaxation
- np hard problems
- greedy algorithm
- multidimensional knapsack problem
- dynamic programming
- heuristic solution
- maximum profit
- decision variables
- bicriteria
- evolutionary algorithm
- continuous relaxation
- multiple objectives
- reinforcement learning
- greedy heuristic