An exact algorithm for the budget-constrained multiple knapsack problem.
Byungjun YouTakeo YamadaPublished in: Int. J. Comput. Math. (2011)
Keyphrases
- knapsack problem
- exact algorithms
- combinatorial optimization problems
- optimization problems
- optimal solution
- dynamic programming
- greedy heuristic
- test problems
- greedy algorithm
- neural network
- np hard
- np hard problems
- multiple objectives
- sensitivity analysis
- cutting plane
- decision variables
- linear programming relaxation
- special case
- multidimensional knapsack problem