Minimum Complete Pareto Front of the Biobjective 0-1 Knapsack Problem
We propose an exact algorithm that constructs the minimum complete Pareto front of the biobjective knapsack problem with one linear objective function (that represents profit) and one nonlinear objective function (that represents risk). The algorithm is composed by two stages. The first stage is using a dynamic program...