Solution of Multidimensional Knapsack Problem via Cooperation of Dynamic Programming and Branch and Bound

This article presents an exact cooperative method for the solution of the Multidimensional Knapsack Problem (MKP ) which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and problems in the literature. Solution values of the first step are compared with optimal values and results provided by other well known existing heuristics. Then our exact cooperative method is compared with a classical branch and bound algorithm.