Jun Han, Graham McMahon, Stephen Sugden. A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem (Research Note). In Burkhard Monien, Rainer Feldmann, editors, Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings. Volume 2400 of Lecture Notes in Computer Science, pages 404-408, Springer, 2002. [doi]
@inproceedings{HanMS02:0,
title = {A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem (Research Note)},
author = {Jun Han and Graham McMahon and Stephen Sugden},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2400/24000404.htm},
researchr = {https://researchr.org/publication/HanMS02%3A0},
cites = {0},
citedby = {0},
pages = {404-408},
booktitle = {Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings},
editor = {Burkhard Monien and Rainer Feldmann},
volume = {2400},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-44049-6},
}