Balancing the profit and capacity under uncertainties: a target-based distributionally robust knapsack problem.
Jianpeng DingLiuxin ChenGinger Y. KeYuanbo LiLianmin ZhangPublished in: Int. Trans. Oper. Res. (2022)
Keyphrases
- knapsack problem
- maximum profit
- combinatorial optimization problems
- optimization problems
- optimal solution
- test problems
- exact algorithms
- dynamic programming
- bicriteria
- linear programming relaxation
- greedy algorithm
- np hard
- np hard problems
- robust optimization
- heuristic solution
- multidimensional knapsack problem
- production planning
- decision variables
- greedy heuristic
- continuous relaxation
- optimal capacity
- lp relaxation
- vehicle routing problem
- simulated annealing
- evolutionary algorithm
- lower bound
- search algorithm