A two-phase algorithm for the biobjective integer minimum cost flow problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2008

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

Résumé

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.

Dates et versions

hal-00466665 , version 1 (24-03-2010)

Identifiants

Citer

Andrea Raith, Matthias Ehrgott. A two-phase algorithm for the biobjective integer minimum cost flow problem. Computers and Operations Research, 2008, 36 (6), pp.1945-1954. ⟨10.1016/j.cor.2008.06.008⟩. ⟨hal-00466665⟩
86 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More