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]
@inproceedings{GruberR08,
title = {Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem},
author = {Martin Gruber and Günther R. Raidl},
year = {2008},
doi = {10.1109/SAINT.2008.68},
url = {http://doi.ieeecomputersociety.org/10.1109/SAINT.2008.68},
tags = {systematic-approach},
researchr = {https://researchr.org/publication/GruberR08},
cites = {0},
citedby = {0},
pages = {261-264},
booktitle = {Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, 28 July - 1 August 2008, Turku, Finland},
publisher = {IEEE Computer Society},
isbn = {978-0-7695-3297-4},
}