Abstract
In this paper, we design a new branch-and-bound algorithm to solve a variant of graph partition problem called two-level graph partition problem, which is arisen in mobile wireless communications. We first exploit the two-level structure of the problem, and propose a new semidefinite relaxation for the problem. Some valid constraints are derived to enhance the tightness of the semidefinite relaxation. Furthermore, we analyze the symmetric structure of the two-level graph partition problem, and propose an effective branch pruning rule to handle the symmetry. Based on the proposed semidefinite relaxation and the symmetry handing technique, a branch-and-bound algorithm is proposed. Our numerical results show that the proposed algorithm outperforms the existing linear integer programming based algorithm on two-level graph partition problems with high density.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
