19 citations · 22 across the 5 of their papers we have counts for
7 papers
On the T-Adaptive Segment Routing Problem
Amal Benhamiche, Kaoutar Bouaachra, Yannick Carlinet +3
In this paper, we present a multi-period optimization problem arising from the traffic engineering of core IP/MPLS networks, called T-ASR. This problem aims at computing a sequence…
A quantum feasibility preserving modeling for the min cut problem
Ali Abbassi, Yann Dujardin, Eric Gourdin +2
We study the minimum cut problem in weighted undirected graphs using variational quantum algorithms in which only feasible cut configurations are explored. Although minimum cut adm…
Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time
Thibaut Cuvelier, Richard Combes, Eric Gourdin
We consider combinatorial semi-bandits with uncorrelated Gaussian rewards. In this article, we propose the first method, to the best of our knowledge, that enables to compute the s…
Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits
Thibaut Cuvelier, Richard Combes, Eric Gourdin
We consider combinatorial semi-bandits over a set of arms where rewards are uncorrelated across items. For this problem, the algorithm ESCB yields the…
Key technologies to accelerate the ICT Green evolution -- An operator's point of view
Azeddine Gati, Fatma Ezzahra Salem, Ana Maria Galindo Serrano +17
The exponential growth in networks' traffic accompanied by the multiplication of new services like those promised by the 5G led to a huge increase in the infrastructures' energy co…
A study on load-balanced variants of the bin packing problem
Davi Castro-Silva, Eric Gourdin
We consider several extensions of the fractional bin packing problem, a relaxation of the traditional bin packing problem where the objects may be split across multiple bins. In th…