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]
@inproceedings{HanMS02,
title = {A Branch and Bound Algorithm for Minimum Cost Network Flow Problem},
author = {Jun Han and Graham McMahon and Stephen Sugden},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2412/24120167.htm},
tags = {data-flow},
researchr = {https://researchr.org/publication/HanMS02},
cites = {0},
citedby = {0},
pages = {167-172},
booktitle = {Intelligent Data Engineering and Automated Learning - IDEAL 2002, Third International Conference, Manchester, UK, August 12-14, Proceedings},
editor = {Hujun Yin and Nigel M. Allinson and Richard T. Freeman and John A. Keane and Simon J. Hubbard},
volume = {2412},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-44025-9},
}