A Branch and Bound Algorithm for Capacitated Minimum Spanning Tree Problem (Research Note) - 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 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]

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