On finding representative non-dominated points for bi-objective integer network flow problems

Eusébio, Augusto and Figueira, José Rui and Ehrgott, Matthias (2014) On finding representative non-dominated points for bi-objective integer network flow problems. Computers and Operations Research, 48. pp. 1-10. ISSN 0305-0548

Full text not available from this repository.

Abstract

This paper proposes a new algorithm to find a representation of the set of all non-dominated points of the bi-objective integer network flow problem. The algorithm solves a sequence of ε-constraint problems with a branch-and-bound algorithm to find a subset of non-dominated points that represents the set of all non-dominated points well in the sense of coverage or uniformity. At each iteration of the algorithm, one non-dominated point, determined by solving one ε-constraint problem, is added to the representation until it is guaranteed that the representation has the desired quality. Computational experiments on different problem types show the efficacy of the algorithm.

Item Type:
Journal Article
Journal or Publication Title:
Computers and Operations Research
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700
Subjects:
ID Code:
80953
Deposited By:
Deposited On:
15 Sep 2016 14:28
Refereed?:
Yes
Published?:
Published
Last Modified:
11 Feb 2020 09:01