BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:426@lincs.fr
DTSTART;TZID=Europe/Paris:20190130T140000
DTEND;TZID=Europe/Paris:20190130T140000
DTSTAMP:20190213T122339Z
URL:https://www.lincs.fr/events/talk-by-makhlouf-hadji-2/
SUMMARY:Resource Allocation in Cloud Radio Access Networks: A Combinatorial
 Optimization Point of View
DESCRIPTION:\n In this presentation\, we would like to focus on two well
 known NP-Hard problems and then provide a combinatorial optimization
 view&nbsp\; before proposing new and efficient solutions. Thus\, we will
 focus on two main topics: constrained resource allocation and full coverage
 hole in C-RAN.&nbsp\;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. \n
CATEGORIES:Seminars,Youtube
LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013
 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20181028T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR