Multiple objective minimum cost flow problems: A review

被引：39
作者：
Hamacher, Horst W.
Pedersen, Christian Roed
Ruzika, Stefan
机构：
[1] Univ Kaiserslautern, Fachbereich Math, D-67653 Kaiserslautern, Germany
[2] Univ Aarhus, Dept Operat Res, Aarhus, Denmark
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2007年 / 176卷 / 03期
关键词：
multiple objective programming; network flows; efficient solution; approximation;
D O I：
10.1016/j.ejor.2005.09.033
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, theory and algorithms for solving the multiple objective minimum cost flow problem are reviewed. For both the continuous and integer case exact and approximation algorithms are presented. In addition, a section on compromise solutions summarizes corresponding results. The reference list consists of all papers known to the authors which deal with the multiple objective minimum cost flow problem. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：1404 / 1422
页数：19
相关论文
共 52 条
123456