Abstract
We focus on the full coverage hole problem in the context of Cloud Radio Access Networks while considering joint holes detection and cells interferences minimization. We propose a Branch and Cut algorithm describing the convex hull of this NP-Hard problem. New valid inequalities based on chordless cycles detection and network connectivity are added to this formulation to accelerate convergence time and detect rapidly coverage holes. Our Branch and Cut algorithm finds optimal solutions in acceptable times even for large problem instances. Simulation results and comparison to the state of the art highlight the efficiency and the usefulness of our approach.
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 call
