Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem.
Mhand HifiM. MichrafyPublished in: Comput. Oper. Res. (2007)
Keyphrases
- exact algorithms
- knapsack problem
- combinatorial optimization problems
- optimal solution
- vehicle routing problem with time windows
- benders decomposition
- multidimensional knapsack problem
- np hard
- optimization problems
- bicriteria
- dynamic programming
- linear programming relaxation
- greedy algorithm
- randomly generated test instances
- exact solution
- cutting plane
- greedy heuristic
- continuous relaxation
- search strategies
- combinatorial optimization
- orders of magnitude
- special case
- evolutionary algorithm
- objective function
- implicit enumeration
- neural network