Nom de l'éditeur

Ville de l'éditeur

Année

ISBN

URI

Collections

Métadonnées

Auteur

Bazgan, Cristina

Hugot, Hadrien

Vanderpooten, Daniel

Type

Communication / Conférence

Nombre de pages du document

406-419

Résumé en anglais

In this paper, we present an approach, based on dynamic programming, for solving 0-1 multi-objective knapsack problems. 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.