|Speaker :||Makhlouf Hadji|
|IRT - System X|
|Location:||LINCS / EIT Digital|
In this presentation, we would like to focus on two well known NP-Hard problems and then provide a combinatorial optimization view before proposing new and efficient solutions. Thus, we will focus on two main topics: constrained resource allocation and full coverage hole in C-RAN.
The first topic consists in determining the best strategies to assign antennas (Remote Radio Head – RRH) demands to available edge data centers (pool of BaseBand Units – BBU) when jointly optimizing communication latency and resource consumption. The second topic addresses the full coverage hole problem in C-RAN when reducing existing interference. A deep Branch-and-Cut algorithm will be proposed and discussed. This approach is based on the description of new cutting planes to accelerate the convergence time even for large problem instances.