Home > Research > Publications & Outputs > A two-phase algorithm for the biobjective integ...

Research

Links

Text available via DOI:

Keywords

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A two-phase algorithm for the biobjective integer minimum cost flow problem. / Raith, Andrea; Ehrgott, Matthias.
In: Computers and Operations Research, Vol. 36, No. 6, 01.06.2009, p. 1945-1954.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Raith, A & Ehrgott, M 2009, 'A two-phase algorithm for the biobjective integer minimum cost flow problem', Computers and Operations Research, vol. 36, no. 6, pp. 1945-1954. https://doi.org/10.1016/j.cor.2008.06.008

APA

Raith, A., & Ehrgott, M. (2009). A two-phase algorithm for the biobjective integer minimum cost flow problem. Computers and Operations Research, 36(6), 1945-1954. https://doi.org/10.1016/j.cor.2008.06.008

Vancouver

Raith A, Ehrgott M. A two-phase algorithm for the biobjective integer minimum cost flow problem. Computers and Operations Research. 2009 Jun 1;36(6):1945-1954. doi: 10.1016/j.cor.2008.06.008

Author

Raith, Andrea ; Ehrgott, Matthias. / A two-phase algorithm for the biobjective integer minimum cost flow problem. In: Computers and Operations Research. 2009 ; Vol. 36, No. 6. pp. 1945-1954.

Bibtex

@article{b72647659c9e499b9b78f67efae69ea3,
title = "A two-phase algorithm for the biobjective integer minimum cost flow problem",
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.",
keywords = "Biobjective integer minimum cost flow problem, Two phase method , k best flow algorithm",
author = "Andrea Raith and Matthias Ehrgott",
year = "2009",
month = jun,
day = "1",
doi = "10.1016/j.cor.2008.06.008",
language = "English",
volume = "36",
pages = "1945--1954",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",
number = "6",

}

RIS

TY - JOUR

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

AU - Raith, Andrea

AU - Ehrgott, Matthias

PY - 2009/6/1

Y1 - 2009/6/1

N2 - 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.

AB - 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.

KW - Biobjective integer minimum cost flow problem

KW - Two phase method

KW - k best flow algorithm

U2 - 10.1016/j.cor.2008.06.008

DO - 10.1016/j.cor.2008.06.008

M3 - Journal article

VL - 36

SP - 1945

EP - 1954

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 6

ER -