The Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs

We prove that the Minimum Concave Cost Network Flow Problem with fixed numbers of sources and nonlinear arc costs can be solved by an algorithm requiring a number of elementary operations and a number of evaluations of the nonlinear cost functions which are both bounded by polynomials inr, n, m, wherer is the number of nodes,n is the number of arcs andm the number of sinks in the network.

[1]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

[2]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.

[3]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[4]  H. Tuy,et al.  Strongly polynomial algorithm for a production-transportation problem with concave production cost , 1993 .

[5]  Clyde L. Monma,et al.  Send-and-Split Method for Minimum-Concave-Cost Network Flows , 1987, Math. Oper. Res..

[6]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[7]  Peter Värbrand,et al.  Strongly polynomial algorithm for two special minimum concave cost network flow problems , 1995 .

[8]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[9]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[10]  Panos M. Pardalos,et al.  Algorithms for the single-source uncapacitated minimum concave-cost network flow problem , 1991, J. Glob. Optim..

[11]  Bettina Klinz,et al.  Minimum Concave-Cost Network Flow Problems with a Single Nonlinear Arc Cost , 1993 .

[12]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[13]  Panos M. Pardalos,et al.  Complexity Issues in Nonconvex Network Flow Problems , 1993 .

[14]  Hoang Tuy,et al.  Strongly polynomial time algorithms for certain concave minimization problems on networks , 1993, Oper. Res. Lett..

[15]  Phan Thien Thach.  A decomposition method for the min concave cost flow problem with a staircase structure , 1990 .

[16]  Arthur F. Veinott,et al.  Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems , 1969, Oper. Res..

[17]  G. Gallo,et al.  Adjacent extreme flows and application to min concave cost flow problems , 1979, Networks.

[18]  Michael Florian,et al.  An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem , 1971 .

[19]  Peter Värbrand,et al.  A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables , 1996, Math. Program..

[20]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[21]  Hoang Tuy,et al.  The complementary convex structure in global optimization , 1992, J. Glob. Optim..

[22]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[23]  Stein W. Wallace.  Decomposing the requirement space of a transporation problem into polyhedral cones , 1986 .

[24]  Panos M. Pardalos,et al.  Open questions in complexity theory for numerical optimization , 1992, Mathematical programming.

[25]  Panos M. Pardalos,et al.  A polynomial time solvable concave network flow problem , 1993, Networks.

[26]  Hoang Tuy,et al.  An efficient solution method for rank two quasiconcave minimization problems , 1992 .

[27]  Panos M. Pardalos,et al.  Minimum concave-cost network flow problems: Applications, complexity, and algorithms , 1991 .

[28]  Giorgio Gallo,et al.  An algorithm for the min concave cost flow problem , 1980 .