About Minimum Cost Flow Problem in Networks with Node Capacities

被引：0

作者：

Ciupala, Laura ^{[1
]}

机构：

[1] Univ Transilvania Brasov, Dept Comp Sci, Iuliu Maniu St 50, Brasov, Romania

来源：

PROCEEDINGS OF THE 13TH WSEAS INTERNATIONAL CONFERENCE ON COMPUTERS | 2009年

关键词：

Network flow; Network algorithms; Minimum cost flow problem; ALGORITHM;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we describe and solve the problem of establishing a minimum cost flow in networks with node capacities. We show that this problem, which has several applications, can be reduced to a standard minimum cost flow problem in a transformed network.

引用

页码：67 / +

页数：2

共 9 条

[1]

Ahuja RK, 1995, NETWORK FLOWS THEORY

[2]

[Anonymous], 2001, Digraphs: theory, algorithms and applications

[3] Network information flow with correlated sources [J].

Barros, J ;

Servetto, SD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (01) :155-170

[4] A deficit scaling algorithm for the minimum flow problem [J].

Ciupala, Laura .

SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2006, 31 (3) :227-233

[5]

Ciupala L, 2005, CONTROL CYBERN, V34, P1169

[6]

Patkar S. B., 2004, WSEAS Transactions on Circuits and Systems, V3, P47

[7] On the history of the transportation and maximum flow problems [J].

Schrijver, A .

MATHEMATICAL PROGRAMMING, 2002, 91 (03) :437-445

[8]

SOKKALINGAM PT, 2001, NEW POYNOMIAL TIME C

[9] A polynomial combinatorial algorithm for generalized minimum cost flow [J].

Wayne, KD .

MATHEMATICS OF OPERATIONS RESEARCH, 2002, 27 (03) :445-459

← 1 →