The biobjective integer minimum cost flow problem – incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm

The biobjective integer minimum cost flow problem – incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm

0.00 Avg rating0 Votes
Article ID: iaor20072036
Country: United Kingdom
Volume: 33
Issue: 5
Start Page Number: 1459
End Page Number: 1463
Publication Date: May 2006
Journal: Computers and Operations Research
Authors: , ,
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.

Reviews

Required fields are marked *. Your email address will not be published.