A Branch and Bound Algorithm for Minimum Cost Network Flow Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Jun Han, Graham McMahon, Stephen Sugden. A Branch and Bound Algorithm for Minimum Cost Network Flow Problem. In Hujun Yin, Nigel M. Allinson, Richard T. Freeman, John A. Keane, Simon J. Hubbard, editors, Intelligent Data Engineering and Automated Learning - IDEAL 2002, Third International Conference, Manchester, UK, August 12-14, Proceedings. Volume 2412 of Lecture Notes in Computer Science, pages 167-172, Springer, 2002. [doi]

This author has not been identified. Look up 'Jun Han' in GoogleThis author has not been identified. Look up 'Graham McMahon' in GoogleThis author has not been identified. Look up 'Stephen Sugden' in Google

runs on WebDSL