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

Volltext

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

Volltext

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

Volltext

Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem von Bazgan, Cristina, Beaujean, Paul, Gourdin, Éric

Volltext

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

Volltext

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

Volltext

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

Volltext

Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits von Cuvelier, Thibaut, Combes, Richard, Gourdin, Eric

Volltext

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

Volltext

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

Volltext

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

Volltext

Cache Location in Tree Networks: Preliminary Results von Pierre, Bauguion, Walid, Ben Ameur, Eric, Gourdin

Volltext

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

Volltext

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

Volltext

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

Volltext

Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits von Cuvelier, Thibaut, Combes, Richard, Gourdin, Eric

Volltext

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

Volltext

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

Volltext

Internet routing and related topology issues von BEN-AMEUR, Walid, GOURDIN, Eric

Volltext

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

Volltext