Article ID Journal Published Year Pages File Type
474309 Computers & Operations Research 2006 5 Pages PDF
Abstract

In this paper, we show with a counterexample, that the method proposed by Sedeño-Noda and Gonzàlez-Martin for the biobjective integer minimum flow problem is not able to find all efficient integer points in objective space.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
The biobjective integer minimum cost flow problem—incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
Authors
, , ,