An efficient implementation for the 0-1 multi-objective Knapsack problem

Authors:
Cristina Bazgan;Hadrien Hugot;Daniel Vanderpooten
Affiliations:
LAMSADE, Université Paris Dauphine, Paris Cedex 16, France;LAMSADE, Université Paris Dauphine, Paris Cedex 16, France;LAMSADE, Université Paris Dauphine, Paris Cedex 16, France
Venue:
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Year:
2007

Citing 5
Cited 2

On Finding the Maxima of a Set of Vectors

Journal of the ACM (JACM)
Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem

Journal of Global Optimization
Solving bicriteria 0-1 knapsack problems using a labeling algorithm

Computers and Operations Research
Multicriteria Optimization

Multicriteria Optimization
Bound sets for biobjective combinatorial optimization problems

Computers and Operations Research

A practical efficient fptas for the 0-1 multi-objective knapsack problem

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Using bound sets in multiobjective optimization: application to the biobjective binary knapsack problem

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 nondominated 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.