A Branch and Bound Algorithm for Minimum Cost Network Flow Problem
In this paper we introduce a branch and bound algorithm for finding tree solution of minimum cost network flow problem. We consider different situations such as unit and non-unit traffic demand. The methods used to prune the searching tree in different situations are emphasized respectively but the complete searching process is not interpreted in detail due to limited space. Programming test results show the efficiency of these techniques.
Unable to display preview. Download preview PDF.
- 1.Berry, L.T.M.; Murtagh, B.A., McMahon, G.B., Sugden, S.J. and Welling, L.D. An Integrated GA-LP Approach to Communication Network Design. Telecommunication Systems Journal (1999).Google Scholar
- 3.Berry, L.T.M., Murtagh, B.A., Sugden, S.J. and McMahon, G.B., Application of a Genetic-based Algorithm for Optimal Design of Tree-structured Communication Networks, Proceedings of the Regional Teletraffic Engineering Conference of the International Teletraffic Congress, South Africa, September (1995) 361–370.Google Scholar
- 6.Randall, M., McMahon, G. and Sugden, S., A Simulated Annealing Approach to Communication Network Design, TR99-04, School of Information Technology, Bond University, (1999).Google Scholar
- 7.Ahuja, R., Magnanti, T.; Orlin, J.: Network Flows: Theory, Algorithms and Applications, Prentice Hall, New Jersey (1993).Google Scholar