Finding maximum likelihood estimators for the three-parameter Weibull distribution. - Éric Gourdin; Pierre Hansen; Brigitte Jaumard (J. Glob. Optim., 1994)

Global Optimization Decomposition Methods for Bounded Parameter Minimax Risk Evaluation. - Éric Gourdin; Brigitte Jaumard; Brenda MacGibbon (SIAM J. Sci. Comput., 1994)

Global optimization of Hölder functions. - Éric Gourdin; Brigitte Jaumard; Rachid Ellaia (J. Glob. Optim., 1996)

The Uncapacitated Facility Location Problem with Client Matching. - Éric Gourdin; Martine Labbé; Gilbert Laporte (Oper. Res., 2000)

Internet Routing and Related Topology Issues. - Walid Ben-Ameur; Éric Gourdin (SIAM J. Discret. Math., 2003)

A branch and cut algorithm for hub location problems with single assignment. - Martine Labbé; Hande Yaman; Éric Gourdin (Math. Program., 2005)

Demonstration with field trails of a satellite-terrestrial synergistic approach for digital multimedia broadcasting to mobile users. - Ilias Andrikopoulos; Abraham Pouliakis; Ioannis Mertzanis; Merkourios Karaliopoulos; Kanagasabapathy Narenthiran; Barry G. Evans; Thibault Gallet; Michel Durand; Michel Mazzella; Jürgen Vandermot; Michael Dieudonne; Laurent Roullet; et al. (IEEE Wirel. Commun., 2005)

Design of survivable IP-over-optical networks. - Sylvie Borne; Éric Gourdin; Bernard Liau; Ali Ridha Mahjoub (Ann. Oper. Res., 2006)

Computing optimal max-min fair resource allocation for elastic flows. - Dritan Nace; Nhat Linh Doan; Éric Gourdin; Bernard Liau (IEEE/ACM Trans. Netw., 2006)

Biclique completion problems for multicast network design. - Nathalie Faure; Philippe Chrétienne; Éric Gourdin; Francis Sourd (Discret. Optim., 2007)

Max-min fair survivable networks. - Alfred Bashllari; Dritan Nace; Éric Gourdin; Olivier Klopfenstein (Ann. des Télécommunications, 2008)

Multi-period capacitated location with modular equipments. - Éric Gourdin; Olivier Klopfenstein (Comput. Oper. Res., 2008)

Optimization of OSPF Routing in IP Networks. - Andreas Bley; Bernard Fortz; Éric Gourdin; Kaj Holmberg; Olivier Klopfenstein; Michal Pióro; Artur Tomaszewski; Hakan Ümit (Graphs and Algorithms in Communication Networks, 2010)

A Combinatorial Exchange for Complex Grid Services. - Melanie Moßmann; Jochen Stößer; Adam Ouorou; Éric Gourdin; Ruby Krishnaswamy; Dirk Neumann 001 (Economic Models and Algorithms for Distributed Systems, 2010)

On maximizing collaboration in Wireless Mesh Networks without monetary incentives. - Gabriel Popa; Éric Gourdin; Franck Legendre; Merkourios Karaliopoulos (WiOpt, 2010)

Combinatorial auctions for exchanging resources over a grid network. - Lucile Denoeud-Belgacem; Éric Gourdin; Ruby Krishnaswamy; Adam Ouorou (Ann. des Télécommunications, 2010)

A Mixed Integer Model for the Sparsest Cut problem. - Éric Gourdin (Electron. Notes Discret. Math., 2010)

Optimization of network protection against virus spread. - Éric Gourdin; Jasmina Omic; Piet Van Mieghem (DRCN, 2011)

Cache Location in Tree Networks: Preliminary Results. - Pierre-Olivier Bauguion; Walid Ben-Ameur; Éric Gourdin (INOC, 2011)

A branch-and-cut algorithm for the partitioning-hub location-routing problem. - Daniele Catanzaro; Éric Gourdin; Martine Labbé; F. Aykut Özsoy (Comput. Oper. Res., 2011)

Some further investigation on maximum throughput: Does network coding really help ? - Éric Gourdin; Yuhui Wang (ITC, 2012)

Strategic network coding - How much and where to code to obtain most of the benefits. - Éric Gourdin; Yuhui Wang; Muriel Médard (NetCod, 2013)

A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow. - Pierre-Olivier Bauguion; Walid Ben-Ameur; Éric Gourdin (Electron. Notes Discret. Math., 2013)

Does network coding improve the throughput of a survivable multicast network ? - Sourour Elloumi; Éric Gourdin; Thibaut Lefebvre (DRCN, 2014)

The location-dispatching problem: Polyhedral results and content delivery network design. - Philippe Chrétienne; Pierre Fouilhoux; Éric Gourdin; Jean-Mathieu Segura (Discret. Appl. Math., 2014)

Optimal hierarchical deployment of caches for video streaming. - Éric Gourdin; Pierre-Olivier Bauguion (NOF, 2015)

Efficient algorithms for the maximum concurrent flow problem. - Pierre-Olivier Bauguion; Walid Ben-Ameur; Éric Gourdin (Networks, 2015)

Foreword. - Prosper Chemouil; Achille Pattavina; Éric Gourdin; Stefano Secci (DRCN, 2016)

The Economics of CDNs and Their Impact on Service Fairness. - Éric Gourdin; Patrick Maillé; Gwendal Simon; Bruno Tuffin (IEEE Trans. Netw. Serv. Manag., 2017)

Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem. - Cristina Bazgan; Paul Beaujean; Éric Gourdin (COCOA, 2018)

Design of reliable communication networks. - Éric Gourdin; Deep Medhi; Achille Pattavina (Ann. des Télécommunications, 2018)

A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem. - Sylvie Borne; Éric Gourdin; Olivier Klopfenstein; Ali Ridha Mahjoub (Comput. Ind. Eng., 2018)

Virtual function placement for service chaining with partial orders and anti-affinity rules. - Zaid Allybokus; Nancy Perrot; Jérémie Leguay; Lorenzo Maggi; Eric Gourdin (Networks, 2018)

Key technologies to accelerate the ICT Green evolution - An operator's point of view. - Azeddine Gati; Fatma Ezzahra Salem; Ana Maria Galindo Serrano; Didier Marquet; Stéphane Le Masson; Thomas Rivera; Dinh Thuy Phan Huy; Zwi Altman; Jean-Baptiste Landre; Olivier Simon; Esther Le Rouzic; Fabrice Bourgart; et al. (CoRR, 2019)

A study on load-balanced variants of the bin packing problem. - Davi Castro-Silva; Eric Gourdin (Discret. Appl. Math., 2019)

Virtual Network Functions Placement and Routing Problem: Path formulation. - Ahlam Mouaci; Éric Gourdin; Ivana Ljubic; Nancy Perrot (Networking, 2020)

Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time. - Thibaut Cuvelier; Richard Combes; Eric Gourdin (ALT, 2021)

The Offline Virtual Network Function Packing Problem. - Yannick Carlinet; Eric Gourdin; Nancy Perrot (ICIN, 2021)

Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem. - Ivana Ljubic; Ahlam Mouaci; Nancy Perrot; Éric Gourdin (Comput. Oper. Res., 2021)

Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits. - Thibaut Cuvelier; Richard Combes; Eric Gourdin (Proc. ACM Meas. Anal. Comput. Syst., 2021)

An approximation algorithm for the maximum spectral subgraph problem. - Cristina Bazgan; Paul Beaujean; Éric Gourdin (J. Comb. Optim., 2022)

Two extended formulations for the virtual network function placement and routing problem. - Ahlam Mouaci; Éric Gourdin; Ivana Ljubic; Nancy Perrot (Networks, 2023)

Congestion Prevention at Ingress Peering Links. - Yannick Carlinet; Eric Gourdin; Nancy Perrot (ITNAC, 2024)