Local branching-based algorithms for the disjunctively constrained knapsack problem.
Hakim AkebMhand HifiMohamed Elhafedh Ould Ahmed MounirPublished in: Comput. Ind. Eng. (2011)
Keyphrases
- knapsack problem
- optimization problems
- exact algorithms
- combinatorial optimization problems
- test problems
- np hard problems
- dynamic programming
- optimal solution
- computational complexity
- orders of magnitude
- combinatorial optimization
- search space
- worst case
- greedy algorithm
- bicriteria
- multidimensional knapsack problem