Solving efficiently the 01 multi-objective knapsack problem
In this paper, we present an approach, based on dynamic programming, for solving the 01 multi-objective knapsack problem. The main idea of the approach relies on the use of several complementary dominance relations to discard partial solutions that cannot lead to new non-dominated criterion vectors. This way, we obtain an efficient method that outperforms the existing methods both in terms of CPU time and size of solved instances. Extensive numerical experiments on various types of instances are reported. A comparison with other exact methods is also performed. In addition, for the first time to our knowledge, we present experiments in the three-objective case.
multi-objective knapsack problem dynamic programming dominance relations non-dominated criterion vectors efficient solutions combinatorial optimization