Upper Bounds for Single-Source Uncapacitated Concave Minimum-Cost Network Flow Problems

Networks

Volumn 41, Issue 4, 2003, Pages 221-228

  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

Concave cost optimization; Heuristics; Local search; Minimum cost network flows

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COSTS; DYNAMIC PROGRAMMING; ERROR ANALYSIS; FUNCTIONS; HEURISTIC METHODS; ITERATIVE METHODS; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

CONCAVE-COST OPTIMIZATION; HEURISTICS; LOCAL SEARCH; MINIMUM-COST NETWORK FLOWS;

TELECOMMUNICATION NETWORKS;

EID: 2142721004     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10076     Document Type: Article

References (31)

1. I. Baybards and R.H. Edahl, A heuristic method for facility planning in telecommunications networks with multiple alternates routes, Naval Res Logist Q 35 (1988), 503-528.
2. C. Bazlamaçci and K. Hindi, Enhanced adjacent extremepoint search and tabu search for the minimum concave-cost uncapacitated transshipment problem, J Oper Res Soc 47 (1996), 1150-1165.
3. J.T. Boardman and C.C. Meckiff, A branch-and-bound formulation to an electricity distribution planning problem, IEEE T Power Ap Syst 104 (1985), 2112-2118.
4. A. Cayley, On the mathematical theory of isomers, Philos Mag 67 (1874), 444.
5. N. Christofides, A. Mingozzi, and P. Toth, State space relaxation procedures for the computation of bounds to routing problems, Networks 11 (1981), 145-164.
6. CPLEX. 2001. ILOG CPLEX 6.5 callable library, ILOG, Inc.
7. T.G. Crainic, M. Florian, and J. Leal, A model for the strategic planning of national freight transportation by rail, Transport Sci 24 (1990), 1-24.
8. H.H. Eggleston, Convexity, Cambridge Tracts in Mathematics and Mathematical Physics, No. 47, Cambridge University Press, Cambridge, 1963.
9. E. Elia, Optimal corporate structuring for multinationals, Ph.D. Thesis, The Business School, Imperial College London, UK, 1997.
10. M. Florian, J.K. Lenstra, and A.H.G. Rinnooy Kan, Deterministic production planning: Algorithms and complexity, Manage Sci 26 (1980), 669-679.
11. D.B.M.M. Fontes, Optimal network design using nonlinear cost flows, Ph.D. thesis, The Business School, Imperial College London, UK, 2000.
12. D.B.M.M. Fontes, E. Hadjiconstantinou, and N. Christofides, Upper bounds for concave minimum network flow problems, Paper presented at Optimization '01, Portugal, 2001.
13. D.B.M.M. Fontes, E. Hadjiconstantinou, and N. Christofides, A new branch-and-bound algorithm for network design using concave cost flows, Technical report, Imperial College London, UK, 2002.
14. G. Gallo and C. Sodini, Adjacent extreme flows and application to min concave cost flow problems, Networks 9 (1979), 95-121.
15. G.M. Guisewite, "Network problems," Handbook of global optimization, R. Horst and P.M. Pardalos (Editors), Kluwer Academic, Dordrecht, 1994, pp. 609-648.
16. G.M. Guisewite and P.M. Pardalos, Algorithms for the single-source uncapacitated minimum concave-cost network flow problem, J Global Optim 3 (1991), 245-265.
17. H.W. Hamacker and S. Tufekci, On the use of lexicographic min cost flows in evacuation modeling, Naval Res Logist Q 34 (1987), 487-503.
18. D.S. Hochbaum and A. Segev, Analysis of a flow problem with fixed charges, Networks 19 (1989), 291-312.
19. A. Kessler and U. Shamir, Decomposition technique for optimal design of water supply networks, Eng Optim 17 (1991), 1-19.
20. D. Kim and P.M. Pardalos, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, Oper Res Lett 24 (1999), 195-203.
21. D. Kim and P.M. Pardalos, A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems, J Global Optim 17 (2000), 225-234.
22. D. Kim and P.M. Pardalos, Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems, Networks 35 (2000), 216-222.
23. B.W. Lamar, "A method for solving network flow problems with general nonlinear arc costs," Network optimization problems, D.-Z. Du and P.M. Pardalos (Editors), World Scientific, Singapore, 1993, pp. 147-167.
24. G.V. Loganathan, J.J. Greene, and T.J. Ahn, Design heuristic for globally minimum cost water distribution systems, J Water Res PI Manage 121 (1995), 182-192.
25. J.W. Moon, "Various proofs of Cayley's formula for counting trees," A seminar on graph theory, F. Harary (Editor), Holt, Rinehart, and Winston, New York, 1967.
26. P.M. Pardalos and J.B. Rosen, Constrained global minimization: Algorithms and applications, Lecture Notes in Computer Science 268, Springer-Verlag, Berlin, 1987.
27. R.E. Rosenthal, A nonlinear network flow algorithm for maximization of benefits in a hydroelectric power system, Oper Res 29 (1981), 763-786.
28. D.K. Smith and G.A. Walters, Evolutionary approach for finding optimal trees in undirected networks, Eur J Oper Res 120 (2000), 593-602.
29. R.M. Soland, Optimal facility location with concave costs, Oper Res 22 (1974), 373-382.
30. W.I. Zangwill, A deterministic multi-period production scheduling model with backlogging, Manage Sci 13 (1966), 105-119.
31. W.I. Zangwill, Minimum concave cost flows in certain networks, Manage Sci 14 (1968), 429-450.