A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem

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]

Abstract

Abstract is missing.