Title of article
The biobjective integer minimum cost flow problem—incorrectness of Sedeño-Noda and Gonzàlez-Martinʹs algorithm
Author/Authors
Anthony Przybylski، نويسنده , , Xavier Gandibleux، نويسنده , , Matthias Ehrgott، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2006
Pages
5
From page
1459
To page
1463
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
Multiobjective programming , Efficient solution , Minimum cost flow problem
Journal title
Computers and Operations Research
Serial Year
2006
Journal title
Computers and Operations Research
Record number
928716
Link To Document