On the flow cost lowering problem

被引：9

作者：

Demgensky, I ^{[1
]}

Noltemeier, H ^{[1
]}

Wirth, HC ^{[1
]}

机构：

[1] Univ Wurzburg, Dept Comp Sci, D-97074 Wurzburg, Germany

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2002年 / 137卷 / 02期

关键词：

minimum cost flow; budget constrained upgrade problem; series-parallel graph;

D O I：

10.1016/S0377-2217(01)00208-9

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper presents the flow cost lowering problem (FCLP), which is an extension to the integral version of the well-known minimum cost flow problem (MCFP). While in the MCFP the flow costs are fixed, the FCLP admits lowering the flow cost, on each arc by upgrading the are. Given a flow value and a bound on the total budget which can be used for upgrading the arcs, the goal is to find an upgrade strategy and a flow of minimum cost. The FCLP is shown to be NP-hard even on series-parallel graphs. On the other hand the paper provides a polynomial time approximation algorithm on series-parallel graphs. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：265 / 271

页数：7