Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives.
Hirad AssimiOscar HarperYue XieAneta NeumannFrank NeumannPublished in: CoRR (2020)
Keyphrases
- knapsack problem
- chance constrained
- multiple objectives
- combinatorial optimization problems
- optimal solution
- exact algorithms
- test problems
- optimization problems
- dynamic programming
- chance constraints
- greedy algorithm
- np hard
- chance constrained programming
- stochastic programming
- production planning
- lower bound
- maximum profit
- evolutionary computation
- worst case
- neural network
- upper bound
- scheduling problem