A Branch and Bound Algorithm for Minimum Cost Network Flow Problem

Authors:
Jun Han;Graham McMahon;Stephen Sugden
Affiliations:
-;-;-
Venue:
IDEAL '02 Proceedings of the Third International Conference on Intelligent Data Engineering and Automated Learning
Year:
2002

Citing 2
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Tabu Search

Tabu Search

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.