Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Martin Gruber, Günther R. Raidl. Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. In Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, 28 July - 1 August 2008, Turku, Finland. pages 261-264, IEEE Computer Society, 2008. [doi]

This author has not been identified. Look up 'Martin Gruber' in GoogleThis author has not been identified. Look up 'Günther R. Raidl' in Google

runs on WebDSL