A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes.
Daniel BladoAlejandro TorielloPublished in: Math. Program. Comput. (2021)
Keyphrases
- knapsack problem
- generation algorithm
- maximum profit
- combinatorial optimization problems
- dynamic programming
- greedy algorithm
- decision variables
- optimal solution
- test problems
- chance constrained
- linear programming relaxation
- exact algorithms
- optimization problems
- production planning
- multiple objectives
- bicriteria
- np hard problems
- multidimensional knapsack problem
- integer variables
- np hard
- heuristic solution
- special case
- continuous relaxation