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

Raith, Andrea and Ehrgott, Matthias (2009) A two-phase algorithm for the biobjective integer minimum cost flow problem. Computers and Operations Research, 36 (6). pp. 1945-1954. ISSN 0305-0548

Full text not available from this repository.

Abstract

We present an algorithm to compute a complete set of efficient solutions for the biobjective integer minimum cost flow problem. We use the two phase method, with a parametric network simplex algorithm in phase 1 to compute all non-dominated extreme points. In phase 2, the remaining non-dominated points (non-extreme supported and non-supported) are computed using a k best flow algorithm on single-objective weighted sum problems. We implement the algorithm and report run-times on problem instances generated with a modified version of the NETGEN generator and also for networks with a grid structure.

Item Type:
Journal Article
Journal or Publication Title:
Computers and Operations Research
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700
Subjects:
ID Code:
64489
Deposited By:
Deposited On:
14 May 2013 08:34
Refereed?:
Yes
Published?:
Published
Last Modified:
29 Jan 2020 07:36