Alessandro Hill, Stefan Voß, Roberto Baldacci. Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts. In Ding-Zhu Du, Zhenhua Duan, Cong Tian, editors, Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings. Volume 11653 of Lecture Notes in Computer Science, pages 266-278, Springer, 2019. [doi]
@inproceedings{HillVB19,
title = {Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts},
author = {Alessandro Hill and Stefan Voß and Roberto Baldacci},
year = {2019},
doi = {10.1007/978-3-030-26176-4_22},
url = {https://doi.org/10.1007/978-3-030-26176-4_22},
researchr = {https://researchr.org/publication/HillVB19},
cites = {0},
citedby = {0},
pages = {266-278},
booktitle = {Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings},
editor = {Ding-Zhu Du and Zhenhua Duan and Cong Tian},
volume = {11653},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-26176-4},
}