A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems

European Journal of Operational Research

Volumn 174, Issue 2, 2006, Pages 1205-1219

  Fontes, Dalila B M M ^a   Hadjiconstantinou, Eleni ^b   Christofides, Nicos ^b  

^a UNIVERSITY OF PORTO   (Portugal)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Combinatorial optimization; Concave cost optimization; Dynamic programming; Global optimization; Network flows

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COSTS; GLOBAL OPTIMIZATION; OPTIMIZATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL EXPERIMENTS; CONCAVE-COST OPTIMIZATION; NETWORK FLOWS;

DYNAMIC PROGRAMMING;

EID: 33746239034     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.03.024     Document Type: Article

References (37)

1. Aho A.V., Hopcroft J.E., and Ullman J.D. Data structures and algorithms (1983), Addison-Wesley, Reading, MA
2. J.E. Beasley, Or-Library, Available from .
3. Bellman R. Dynamic programming (1957), Princeton University Press
4. Burkard R.E., Dollani H., and Thach P.H. 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 19 (2001) 121-139
5. Cayley A. On the mathematical theory of isomers. Philosophical Magazine 67 (1874) 444
6. Cordier C., Marchand H., Laundy R., and Wolsey L.A. bc-opt: A branch and cut code fr mixed integer programs. Mathematical Programming 86 (1999) 335-353
7. Eggleston H.H. Convexity. Cambridge Tracts in Mathematics and Mathematical Physics (1963), Cambridge University Press p. 47
8. E. Elia, Optimal Corporate Structuring for Multinationals, Ph.D. Thesis, The Business School, Imperial College London, UK, 1997.
9. Erickson R.E., Monma C.L., and Veinott Jr. A.F. Send-and-split method for minimum-concave-cost network flows. Mathematics of Operations Research 12 (1987) 634-664
10. D.B.M.M. Fontes, Optimal Network Design Using Nonlinear Cost Flows, Ph.D. Thesis, The Management School, Imperial College London, UK, 2000.
11. Fontes D.B.M.M., Hadjiconstantinou E., and Christofides N. Upper bounds for single source uncapacitated minimum concave-cost network flow problems. Networks 41 (2003) 221-228
12. D.B.M.M. Fontes, E. Hadjiconstantinou, N. Christofides, A branch-and-bound algorithm for concave network flow problems (submitted).
13. D.B.M.M. Fontes, E. Hadjiconstantinou, N. Christofides, Lower bounds from state space relaxations for concave network flow problems (submitted).
14. Forjanis S., and Lamar B.W. Cash flow management network models with discounting. Omega 22 (1994) 149-155
15. Gallo G., Sandi C., and Sodini C. An algorithm for the min concave cost now problem. European Journal of Operations Research 4 (1980) 249-255
16. Guisewite G.M. Network problems. In: Horst R., and Pardalos P.M. (Eds). Handbook of global optimization (1994), Kluwer Academic, Dordrecht 506-648
17. Guisewite G.M., and Pardalos P.M. Minimum concave-cost network flow problems: Applications, complexity, and algorithms. Annals of Operations Research 25 (1990) 75-100
18. Guisewite G.M., and Pardalos P.M. Algorithms for the single-source uncapacitated minimum concave-cost network flow problem. Journal of Global Optimization 3 (1991) 245-265
19. Guisewite G.M., and Pardalos P.M. Global search algorithms for minimum concave-cost network flow problems. Journal of Global Optimization 1 (1991) 309-330
20. Hamacher H.W., and Tufekci S. On the use of lexicographic min cost flows in evacuation modelling. Naval Research Logistics Quarterly 34 (1987) 487-503
21. Hochbaum D.S., and Segev A. Analysis of a flow problem with fixed charges. Networks 19 (1989) 291-312
22. Horst R., and Thoai N.V. An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks. OR Spectrum 20 (1998) 45-53
23. Horst R., and Tuy H. Global optimization and deterministic approaches. third ed. (1996), Springer-Verlag, Berlin
24. Kennedy D. Some branch-and-bound techniques for nonlinear optimization. Mathematical Programming 42 (1988) 147-169
25. Kim D., and Pardalos P.M. A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Operations Research Letters 24 (1999) 195-203
26. Kim D., and Pardalos P.M. A dynamic domain contraction algorithm for nonconvex piece-wise linear network flow problems. Journal of Global Optimization 17 (2000) 225-234
27. Kim D., and Pardalos P.M. Dynamic slope scaling and trust interval techniques for concave piecewise linear network flow problems. Networks 35 (2000) 216-222
28. Kim H.-J., and Hooker J.N. Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach. Annals of Operations Research 115 (2002) 95-124
29. Lamar B.W. A method for solving network flow problems with general nonlinear arc costs. In: Du D.-Z., and Pardalos P.M. (Eds). Network optimization Problems (1993), World Scientific, Singapore
30. Lozovanu D. Properties of optimal solutions of a grid transport problem with concave function of the flows on the arcs. Engineering Cybernetics 20 6 (1983) 34-38
31. Moon J.W. Various proofs of cayley's formula for counting trees. In: Harary (Ed). A seminar on graph theory (1967), Holt, Rinehart, and Winston, New York
32. Ortega F., and Wolsey L.A. A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41 (2003) 143-158
33. Pardalos P.M. Enumerative techniques for solving some nonconvex global optimization problems. OR Spectrum 10 (1988) 29-35
34. Soland R.M. Optimal facility location with concave costs. Operations Research 22 (1974) 373-382
35. Tuy H. The minimum concave-cost network flow problem with a fixed number of nonlinear arc costs: Complexity and approximation. In: Pardalos P.M. (Ed). Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (2000), Kluwer Academic, Dordrecht 383-402
36. Wagner H.M. On a class of capacitated transportation problems. Management Science 5 (1959) 304-318
37. Zangwill W.I. Minimum concave cost flows in certain networks. Management Science 14 (1968) 429-450