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

Authors:
Anthony Przybylski;Xavier Gandibleux;Matthias Ehrgott
Affiliations:
LINA-FRE CNRS, Université de Nantes, Nantes Cedex 03, France;LINA-FRE CNRS, Université de Nantes, Nantes Cedex 03, France;Department of Engineering Science, University of Auckland, Private Bag, Auckland, New Zealand
Venue:
Computers and Operations Research
Year:
2006

Citing 1
Cited 2

An algorithm for the biobjective integer minimum cost flow problem

Computers and Operations Research

A two-phase algorithm for the biobjective integer minimum cost flow problem

Computers and Operations Research
Finding non-dominated solutions in bi-objective integer network flow problems

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

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.