A two-phase algorithm for the biobjective integer minimum cost flow problem |
| |
| Authors: | Andrea Raith Matthias Ehrgott |
| |
| Affiliation: | 1. Department of Engineering Science, The University of Auckland, 70 Symonds Street, Auckland 1001, New Zealand;2. Laboratoire d’Informatique de Nantes Atlantique, Université de Nantes, France |
| |
| 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. |
| |
| Keywords: | Biobjective integer minimum cost flow problem Two phase method k best flow algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
