Maximum network flows with concave gains

This paper deals with a generalized maximum flow problem with concave gains, which is a nonlinear network optimization problem. Optimality conditions and an algorithm for this problem are presented. The optimality conditions are extended from the corresponding results for the linear gain case. The algorithm is based on the scaled piecewise linear approximation and on the fat path algorithm described by Goldberg, Plotkin and Tardos for linear gain cases. The proposed algorithm solves a problem with piecewise linear concave gains faster than the naive solution by adding parallel arcs.

[1]  James B. Orlin,et al.  Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem , 1997, Math. Oper. Res..

[2]  Deepak K. Merchant,et al.  A Model and an Algorithm for the Dynamic Traffic Assignment Problems , 1978 .

[3]  S. Thomas McCormick,et al.  Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications , 1997, SIAM J. Comput..

[4]  Andrew V. Goldberg,et al.  Combinatorial Algorithms for the Generalized Circulation Problem , 1991, Math. Oper. Res..

[5]  John M. Mulvey,et al.  Nonlinear programming on generalized networks , 1987, TOMS.

[6]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[7]  Éva Tardos,et al.  Generalized maximum flow algorithms , 1999 .

[8]  J. George Shanthikumar,et al.  Convex separable optimization is not much harder than linear optimization , 1990, JACM.

[9]  Tomasz Radzik,et al.  Combinatorial approximation algorithms for generalized flow problems , 1999, SODA '99.

[10]  Shengxiang Yang,et al.  Experimental evaluation of algorithmic solutions for the maximum generalised network flow problem , 2001 .

[11]  A. Nakayama,et al.  TWO EFFICIENT ALGORITHMS FOR THE GENERALIZED MAXIMUM BALANCED FLOW PROBLEM , 2002 .

[12]  Paul Tseng,et al.  An ε-relaxation method for separable convex cost generalized network flow problems , 2000, Math. Program..

[13]  K. Onaga.  Dynamic Programming of Optimum Flows in Lossy Communication Nets , 1966 .

[14]  S. Fujishige,et al.  A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM , 2004 .

[15]  M. Minoux.  Solving integer minimum cost flows with separable convex cost objective polynomially , 1986 .