A two-level graph partitioning problem arising in mobile wireless communications

作者：Fairbrother Jamie^*; Letchford Adam N.; Briggs Keith

来源：Computational Optimization and Applications, 2018, 69(3): 653-676.

DOI：10.1007/s10589-017-9967-9

• Graph partitioning
• Integer programming
• Cutting planes
• Telecommunications

In the k -partition problem (k-PP), one is given an edge-weighted undirected graph, and one must partition the node set into at most k subsets, in order to minimise (or maximise) the total weight of the edges that have their end-nodes in the same subset. Various hierarchical variants of this problem have been studied in the context of data mining. We consider a 'two-level' variant that arises in mobile wireless communications. We show that an exact algorithm based on intelligent preprocessing, cutting planes and symmetry-breaking is capable of solving small- and medium-size instances to proven optimality, and providing strong lower bounds for larger instances.

• 出版日期2018-4