Solving the biobjective zero–one knapsack problem by an efficient linear programming-based heuristic

In this paper, we propose a simple and useful method, the core of which is an efficient LP-based heuristic, for solving biobjective 0–1 knapsack problems. Extensive computational experiments show that the proposed method is able to generate a good approximation to the nondominated set very efficiently. We also suggest three qualitative criteria to evaluate such an approximation. In addition, the method can be extended to other problems having properties similar to the knapsack problem.