Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks

Journal of Global Optimization

Volumn 19, Issue 2, 2001, Pages 121-139

  Burkard, Rainer E ^a   Dollani, Helidon ^a   Thach, Phan Thien ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b INSTITUTE OF MATHEMATICS   (Viet Nam)

Author keywords

Concave costs; Convergence; Dynamic programming; Linear approximation; Uncapacitated single source acyclic networks

Indexed keywords

EID: 0348238284     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008379621400     Document Type: Article

References (14)

1. Erickson, R.E., Monma, C.L. and Veinott Jr., A.F. (1987), Send-and-split method for minimum-concave-cost network flows, Mathematics of Operations Research 12: 634-664.
2. Falk, J.E. and Hoffman, K.L. (1976), A successive underestimation method for concave minimization problems, Mathematics of Operations Research 1: 251-259.
3. Ford Jr., L.R. and Fulkerson, D.R. (1962), Flows in Networks, Princeton University Press, Princeton, New Jersey.
4. Gallo, G., Sandi, C. and Sodini, C. (1980), An algorithm for the min concave cost flow problem, European Journal of Operational Research 4: 248-259.
5. Guisewite, G.M. and Pardalos, P.M. (1990), Minimum concave-cost network flow problems: applications, complexity, and algorithms, Annals of Operations Research 25: 75-100.
6. Guisewite, G.M. and Pardalos, P.M. (1991), Algorithms for the single-source uncapacitated minimum concave-cost network flow problem. Journal of Global Optimization 1: 245-265.
7. Holmqvist, K., Migdalas, A. and Pardalos, P.M. (1998), A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 40: 131-142.
8. Kim, D. and Pardalos, P.M. (1999), A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Operations Research Letters 24: 195-203.
9. Kim, D. and Pardalos, P.M. (2000), Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems, Networks 35: 216-222.
10. Klinz, B. and Tuy, H. (1993), Minimum concave-cost network flow problems with a single nonlinear arc cost, in: P. Pardalos and D. Du (eds.), Network Optimization Problems, World Scientific, pp. 125-143.
11. Tuy, H. (2000), The minimum concave-cost network flow problem with a fixed number of nonlinear arc costs: complexity and approximation, in: P.M. Pardalos (ed.), Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, Kluwer Academic Publishers, pp. 383-402.
12. Tuy, H., Ghannadan, S., Migdalas, A. and Värbrand, P. (1996), A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables, Mathematical Programming 72: 229-258.
13. Wagner, H.M. (1975), Principles of Operations Research, 2nd edition, Prentice-Hall, Inc., Englewood Cliffs, New Jersey.
14. Zangwill, W.I. (1968), Minimum concave cost flows in certain networks, Management Science 14: 429-450.