The stochastic bilevel continuous knapsack problem with uncertain follower's objective.
Christoph BuchheimDorothee HenkeJannik IrmaiPublished in: CoRR (2021)
Keyphrases
- knapsack problem
- multiple objectives
- implicit enumeration
- chance constrained
- combinatorial optimization problems
- bi objective
- optimization problems
- test problems
- optimal solution
- np hard
- dynamic programming
- production planning
- exact algorithms
- linear programming relaxation
- greedy algorithm
- multidimensional knapsack problem
- heuristic solution
- bicriteria
- linear programming
- objective function
- np hard problems
- decision variables
- greedy heuristic
- maximum profit
- multistage
- machine learning
- continuous domains
- dna computing
- cost function
- reinforcement learning
- neural network