A Branch-and-Bound algorithm for concave network flow problems

Journal of Global Optimization

Volumn 34, Issue 1, 2006, Pages 127-155

  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

Branch and bound; Concave network flows; Dynamic programming; Global optimization; State space relaxation

Indexed keywords

DYNAMIC PROGRAMMING; GLOBAL OPTIMIZATION; PROBLEM SOLVING;

BRANCH-AND-BOUND; CONCAVE NETWORK FLOWS; STATE SPACE RELAXATION;

ALGORITHMS;

EID: 29144516209     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-005-1658-x     Document Type: Article

References (22)

1. Beasley, J.E. (OR-L), 'Or-Library', http://www.brunel.ac.uk/depts/ma/ research/jeb/info.html.
2. Burkard, R.E., Dollani, H. and Thach, P.H. (2001), 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, 121-139.
3. Christofides, N., Mingozzi, A. and Toth, P. (1981), State space relaxation procedures for the computation of bounds to routing problems, Networks, 11, 145-164.
4. Cordier, C., Marchand, H., Laundy, R. and Wolsey, L.A. (1999), bc-opt: A branch and cut code for mixed integer programs, Mathematical Programming, 86, 335-353.
5. Fontes, D.B.M.M. (2000), Optimal Network Design Using Nonlinear Cost Flows, PhD thesis, The Management School, Imperial College of Science Technology and Medicine, London, U.K.
6. Fontes, D.B.M.M., Hadjiconstantinou, E. and Christofides, N. (2003), Upper bounds for single source uncapacitated minimum concave-cost network flow problems, Networks, 41, 221-228.
7. Fontes, D.B.M.M., Hadjiconstantinou, E. and Christofides, N. (2005a), A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, European Journal of Operational Research, in Press.
8. Fontes, D.B.M.M., Hadjiconstantinou, E. and Christofides, N. (2005b), Lower bounds from state space relaxations for concave network flow problems. This Journal.
9. Gallo, G., Sandi, C. and Sodini, C. (1980), An algorithm for the min concave cost flow problem, European Journal of Operational Research, 4, 249-255.
10. Guisewite, G.M. (1994), Network problems, In Horst, R. and Pardalos, P.M. (eds.), Handbook of Global Optimization, Kluwer Academic, Dordrecht, pp. 609-648.
11. Guisewite, G.M. and Pardalos, P.M. (199la), Algorithms for the single-source uncapacitated minimum concave-cost network flow problem', Journal of Global Optimization, 3, 245-265.
12. Guisewite, G.M. and Pardalos, P.M. (1991b), Global search algorithms for minimum concave-cost network flow problems, Journal of Global Optimization, 1, 309-330.
13. Held, M., Karp, R.M. and Crowder, H.P. (1974), Validation of subgradient optimization, Mathematical Programming, 6, 62-88.
14. Hochbaum, D.S. and Segev, A. (1989), Analysis of a flow problem with fixed charges, Networks, 19, 291-312.
15. Horst, R. and Thoai, N.V. (1998), An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks, OR Spectrum, 20, 45-53.
16. 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.
17. Kim, D. and Pardalos, P.M. (2000a), A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems, Journal of Global Optimization, 17, 225-234.
18. Kim, D. and Pardalos, P.M. (2000b), Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems, Networks, 35, 216-222.
19. Kim, H.-J. and Hooker, J. (2002), Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach, Annals of Operations Research, 115, 95-124.
20. Lamar, B.W. (1993), A method for solving network flow problems with general non-linear arc costs, In Du, D.-Z. and Pardalos, P.M. (eds.), Network Optimization Problems, World Scientific, Singapore.
21. Ortega, F. and Wolsey, L.A. (2003), A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem, Networks, 41, 143-158.
22. Zangwill, W.I. (1968), Minimum concave cost flows in certain networks, Management Science, 14, 429-450.