On separating cover inequalities for the multidimensional knapsack problem.
Tolga BektasOsman OguzPublished in: Comput. Oper. Res. (2007)
Keyphrases
- multidimensional knapsack problem
- cover inequalities
- knapsack problem
- genetic algorithm
- tabu search
- linear program
- evolutionary strategy
- convex hull
- multiple choice
- binary variables
- optimal solution
- evolutionary algorithm
- dynamic programming
- lagrangian relaxation
- continuous variables
- vehicle routing problem
- computationally expensive
- linear programming
- optimization problems
- crossover operator
- scheduling problem
- lower bound
- search algorithm