The biobjective integer minimum cost flow problem-incorrectness of Sedeno-Noda and Gonzalez-Martin's algorithm
In this paper, we show with a counterexample, that the method proposed by Sedeno-Noda and Gonzalez-Martin for the biobjective integer minimum flow problem is not able to find all efficient integer points in objective space. (c) 2004 Elsevier Ltd. All rights reserved.
minimum cost flow problem multiobjective programming efficient solution