Strongly polynomial algorithm for two special minimum concave cost network flow problems

We consider two special cases of the Minimum Concave Cost Network Flow Problem (MCCNFP);the single source uncapacitated MCCNFP where all arc costs, except two, are linear and the uncapacitated MCCNFP with 2 sources and 1 nonlinear arc cost. Due to their specific structure these problems can he solved by efficient strongly polynomial time algorithms. More specifically, the algorithms developed have running times polynomial in the number of nodes and arcs and the number of sinks

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

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

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

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

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

[6]  H. M. Wagner.  On a Class of Capacitated Transportation Problems , 1959 .

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

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

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

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

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

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

[13]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

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

[15]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

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

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

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

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

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

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