Hao Pan, Balabhaskar Balasundaram, Juan Sebastian Borrero. A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem. In Christina Büsing, Arie M. C. A. Koster, editors, Proceedings of the 10th International Network Optimization Conference, INOC 2022, Aachen, Germany, June 7-10, 2022. pages 1-6, OpenProceedings.org, 2022. [doi]
@inproceedings{PanBB22,
title = {A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem},
author = {Hao Pan and Balabhaskar Balasundaram and Juan Sebastian Borrero},
year = {2022},
doi = {10.48786/inoc.2022.04},
url = {https://doi.org/10.48786/inoc.2022.04},
researchr = {https://researchr.org/publication/PanBB22},
cites = {0},
citedby = {0},
pages = {1-6},
booktitle = {Proceedings of the 10th International Network Optimization Conference, INOC 2022, Aachen, Germany, June 7-10, 2022},
editor = {Christina Büsing and Arie M. C. A. Koster},
publisher = {OpenProceedings.org},
isbn = {978-3-89318-090-5},
}