A Branch and Bound Algorithm for Minimum Cost Network Flow Problem

Download PDF
Open Webpage

Jun Han, Graham McMahon, Stephen Sugden

Published: 2002, Last Modified: 26 Jul 2025IDEAL 2002EveryoneRevisionsBibTeXCC BY-SA 4.0
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.