Solving bicriteria 0–1 knapsack problems using a labeling algorithm

This paper examines the performances of a new labeling algorithm to find all the efficient paths (or non-dominated evaluation vectors) of the bicriteria 0–1 knapsack problem. To our knowledge this is the first time a bicriteria 0–1 knapsack is solved taking advantage of its previous conversion into a bicriteria shortest path problem over an acyclic network. Computational experiments and results are also presented regarding bicriteria instances of up to 900 items. The algorithm is very efficient for the hard bicriteria 0–1 knapsack instances considered in the paper.