Dynamic resource allocations in virtual networks through a knapsack problem's dynamic programming solution.
Vianney Kengne TchendjiYannick Florian YankamPublished in: ARIMA J. (2019)
Keyphrases
- knapsack problem
- dynamic programming
- optimal solution
- implicit enumeration
- linear programming relaxation
- combinatorial optimization problems
- greedy heuristic
- heuristic solution
- cutting plane
- np hard
- decision variables
- exact algorithms
- continuous relaxation
- greedy algorithm
- multidimensional knapsack problem
- linear programming
- optimization problems
- integer variables
- bicriteria
- lagrangian relaxation
- social networks
- solution quality
- cost function
- lp relaxation
- exact solution
- integer programming
- linear relaxation
- mathematical model
- learning algorithm
- maximum profit