A Dynamic Approach for the Online Knapsack Problem.
Hajer Ben-RomdhaneSihem Ben JouidaSaoussen KrichenPublished in: MDAI (2014)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimization problems
- optimal solution
- test problems
- greedy algorithm
- exact algorithms
- online learning
- multidimensional knapsack problem
- dynamic programming
- np hard
- multiple objectives
- bicriteria
- greedy heuristic
- linear programming relaxation
- np hard problems
- continuous relaxation
- cutting plane
- implicit enumeration
- heuristic solution
- column generation
- decision variables
- machine learning
- evolutionary algorithm
- objective function
- bayesian networks