The biobjective minimum cost flow problem

In this paper, we study the single commodity flow problem, optimizing two objectives simultaneously. We propose a method that finds all the efficient extreme points in the objective space. This method is based on the well known method of Lee and Pulat, which also computes some efficient points of the objective space that are not extreme points. Our alternative method corrects this particularity by using the idea of adjacency among efficient extreme points in the objective space and introduces computational improvements that are shown in an experimental study.