New upper bounds and exact methods for the knapsack sharing problem.
Mhand HifiLei WuPublished in: Appl. Math. Comput. (2014)
Keyphrases
- upper bound
- lower bound
- exact methods
- branch and bound algorithm
- branch and bound
- np hard
- optimal solution
- lower and upper bounds
- integer programming
- worst case
- upper and lower bounds
- knapsack problem
- exact solution
- objective function
- randomly generated
- heuristic methods
- exact algorithms
- machine learning
- running times
- dynamic programming
- tight upper and lower bounds
- feasible solution
- linear programming
- bayesian networks
- genetic algorithm