Search Results - "Gourdin, Eric"

A branch-and-cut algorithm for the partitioning-hub location-routing problem by Catanzaro, Daniele, Gourdin, Eric, Labbé, Martine, Özsoy, F. Aykut

“…We introduce the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. The PHLRP…”
Get full text

An approximation algorithm for the maximum spectral subgraph problem by Bazgan, Cristina, Beaujean, Paul, Gourdin, Éric

“…Modifying the topology of a network to mitigate the spread of an epidemic with epidemiological constant λ amounts to the NP-hard problem of finding a partial…”
Get full text

Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem by Ljubić, Ivana, Mouaci, Ahlam, Perrot, Nancy, Gourdin, Éric

“…•A set of VNFs has to be installed at min-cost, while respecting numerous constraints.•We prove properties of the MIP model, that allow us to derive a Benders…”
Get full text

Two extended formulations for the virtual network function placement and routing problem by Mouaci, Ahlam, Gourdin, Éric, Ljubić, Ivana, Perrot, Nancy

“…Given a bi‐directed graph modeling a telecommunication network, and a set of origin‐destination pairs representing traffic requests (commodities) along with…”
Get full text

The Uncapacitated Facility Location Problem with Client Matching by Gourdin, Eric, Labbe, Martine, Laporte, Gilbert

“…The Uncapacitated Facility Location Problem with Client Matching (LCM) is an extension of the Uncapacitated Facility Location Problem (UFLP), where two clients…”
Get full text

Virtual function placement for service chaining with partial orders and anti‐affinity rules by Allybokus, Zaid, Perrot, Nancy, Leguay, Jérémie, Maggi, Lorenzo, Gourdin, Eric

“…Software‐Defined Networking and Network Function Virtualization are two paradigms that offer flexible software‐based network management. Service providers are…”
Get full text

Multi-period capacitated location with modular equipments by Gourdin, Éric, Klopfenstein, Olivier

“…This work deals with a multi-period capacitated location problem inspired by telecommunication access network planning problems, where demands and costs vary…”
Get full text

The Economics of CDNs and Their Impact on Service Fairness by Gourdin, Eric, Maille, Patrick, Simon, Gwendal, Tuffin, Bruno

“…Content delivery networks (CDNs) have become key telecommunication actors. They contribute to improve significantly the quality of services delivering content…”
Get full text

Design of reliable communication networks by Gourdin, Eric, Medhi, Deep, Pattavina, Achille

Get full text

A Mixed Integer Model for the Sparsest Cut problem by Gourdin, Eric

“…In a capacitated graph with a set of commodities, the sparsity of a cut is the ratio between the capacity of the cut and the demand of the commodities…”
Get full text

A branch and cut algorithm for hub location problems with single assignment by LABBE, Martine, YAMAN, Hande, GOURDIN, Eric

“…The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub…”
Get full text

Efficient algorithms for the maximum concurrent flow problem by Bauguion, Pierre-Olivier, Ben-Ameur, Walid, Gourdin, Eric

“…In this article, we propose a generic decomposition scheme for the maximum concurrent flow problem. This decomposition scheme encompasses many models,…”
Get full text

The location-dispatching problem: Polyhedral results and content delivery network design by Chrétienne, Philippe, Fouilhoux, Pierre, Gourdin, Eric, Segura, Jean-Mathieu

“…Let G=(V,A) be a directed graph and F be a set of items. The Location-Dispatching Problem consists of determining subsets Li⊆F located at nodes i∈V, minimizing…”
Get full text

Design of survivable IP-over-optical networks by Borne, Sylvie, Gourdin, Eric, Liau, Bernard, Mahjoub, A. Ridha

“…In the past years, telecommunications networks have seen an important evolution with the advances in optical technologies and the explosive growth of the…”
Get full text

A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow by Bauguion, Pierre-Olivier, Ben-Ameur, Walid, Gourdin, Eric

“…In this paper, a new decomposition approach is proposed to solve large size instances of Multicommodity Flow problems. Instead of generating paths, we generate…”
Get full text

Combinatorial auctions for exchanging resources over a grid network by Denoeud-Belgacem, Lucile, Gourdin, Eric, Krishnaswamy, Ruby, Ouorou, Adam

“…In grid systems, users compete for different types of resources such that they may execute their applications. Traditional grid systems are formed of…”
Get full text

Computing Optimal Max-Min Fair Resource Allocation for Elastic Flows by Nace, D., Doan, N.-L., Gourdin, E., Liau, B.

“…In this paper, we consider the max-min fair resource allocation problem as applied to elastic flows. We are interested in computing the optimal max-min fair…”
Get full text

The Offline Virtual Network Function Packing Problem by Carlinet, Yannick, Gourdin, Eric, Perrot, Nancy

“…This paper presents the offline Virtual Network Function Packing (VNF-P) problem, a new challenging optimization problem that telecom operators face when…”
Get full text

Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time by Cuvelier, Thibaut, Combes, Richard, Gourdin, Eric

“…We consider combinatorial semi-bandits with uncorrelated Gaussian rewards. In this article, we propose the first method, to the best of our knowledge, that…”
Get full text

A study on load-balanced variants of the bin packing problem by Castro-Silva, Davi, Gourdin, Eric

“…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…”
Get full text