default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Gourdin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j28]Ahlam Mouaci
, Éric Gourdin, Ivana Ljubic, Nancy Perrot:
Two extended formulations for the virtual network function placement and routing problem. Networks 82(1): 32-51 (2023)- 2022
- [j27]Cristina Bazgan, Paul Beaujean, Éric Gourdin:
An approximation algorithm for the maximum spectral subgraph problem. J. Comb. Optim. 44(3): 1880-1899 (2022) - 2021
- [j26]Ivana Ljubic, Ahlam Mouaci, Nancy Perrot, Éric Gourdin:
Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem. Comput. Oper. Res. 130: 105227 (2021) - [j25]Thibaut Cuvelier, Richard Combes, Eric Gourdin:
Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits. Proc. ACM Meas. Anal. Comput. Syst. 5(1): 09:1-09:31 (2021) - [c13]Thibaut Cuvelier, Richard Combes, Eric Gourdin:
Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time. ALT 2021: 505-528 - [c12]Yannick Carlinet, Eric Gourdin, Nancy Perrot:
The Offline Virtual Network Function Packing Problem. ICIN 2021: 151-158 - [c11]Thibaut Cuvelier, Richard Combes, Eric Gourdin:
Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits. SIGMETRICS (Abstracts) 2021: 5-6 - [i5]Thibaut Cuvelier, Richard Combes, Eric Gourdin:
Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time. CoRR abs/2102.07254 (2021) - 2020
- [c10]Ahlam Mouaci, Éric Gourdin, Ivana Ljubic, Nancy Perrot:
Virtual Network Functions Placement and Routing Problem: Path formulation. Networking 2020: 55-63 - [i4]Thibaut Cuvelier, Richard Combes, Eric Gourdin:
Statistically Efficient, Polynomial Time Algorithms for Combinatorial Semi Bandits. CoRR abs/2002.07258 (2020)
2010 – 2019
- 2019
- [j24]Davi Castro-Silva, Eric Gourdin:
A study on load-balanced variants of the bin packing problem. Discret. Appl. Math. 264: 4-14 (2019) - [i3]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, Stéphane Gosselin, Marc Vautier, Eric Gourdin, Taoufik En-Najjary, Mamdouh El Tabach, Raluca-Maria Indre, Guillaume Gerard, Gwenaelle Delsart:
Key technologies to accelerate the ICT Green evolution - An operator's point of view. CoRR abs/1903.09627 (2019) - 2018
- [j23]Éric Gourdin, Deep Medhi, Achille Pattavina:
Design of reliable communication networks. Ann. des Télécommunications 73(1-2): 1-3 (2018) - [j22]Sylvie Borne, Éric Gourdin, Olivier Klopfenstein, Ali Ridha Mahjoub:
A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem. Comput. Ind. Eng. 124: 582-603 (2018) - [j21]Zaid Allybokus, Nancy Perrot, Jérémie Leguay, Lorenzo Maggi, Eric Gourdin:
Virtual function placement for service chaining with partial orders and anti-affinity rules. Networks 71(2): 97-106 (2018) - [c9]Cristina Bazgan, Paul Beaujean, Éric Gourdin:
Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem. COCOA 2018: 108-122 - [i2]Davi Castro-Silva, Eric Gourdin:
A study on load-balanced variants of the bin packing problem. CoRR abs/1810.12086 (2018) - 2017
- [j20]Éric Gourdin, Patrick Maillé, Gwendal Simon, Bruno Tuffin:
The Economics of CDNs and Their Impact on Service Fairness. IEEE Trans. Netw. Serv. Manag. 14(1): 22-33 (2017) - [i1]Zaid Allybokus, Nancy Perrot, Jérémie Leguay, Lorenzo Maggi, Eric Gourdin:
Virtual Function Placement for Service Chaining with Partial Orders and Anti-Affinity Rules. CoRR abs/1705.10554 (2017) - 2016
- [c8]Prosper Chemouil, Achille Pattavina, Éric Gourdin, Stefano Secci:
Foreword. DRCN 2016: 1 - [e1]Prosper Chemouil, Achille Pattavina, Éric Gourdin, Stefano Secci:
12th International Conference on the Design of Reliable Communication Networks, DRCN 2016, Paris, France, March 15-17, 2016. IEEE 2016, ISBN 978-1-4673-8496-4 [contents] - 2015
- [j19]Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin:
Efficient algorithms for the maximum concurrent flow problem. Networks 65(1): 56-67 (2015) - [c7]Éric Gourdin, Pierre-Olivier Bauguion:
Optimal hierarchical deployment of caches for video streaming. NOF 2015: 1-5 - 2014
- [j18]Philippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura:
The location-dispatching problem: Polyhedral results and content delivery network design. Discret. Appl. Math. 164: 68-85 (2014) - [c6]Sourour Elloumi, Éric Gourdin, Thibaut Lefebvre:
Does network coding improve the throughput of a survivable multicast network ? DRCN 2014: 1-8 - 2013
- [j17]Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin:
A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow. Electron. Notes Discret. Math. 41: 311-318 (2013) - [c5]Éric Gourdin, Yuhui Wang, Muriel Médard:
Strategic network coding - How much and where to code to obtain most of the benefits. NetCod 2013: 1-7 - 2012
- [c4]Éric Gourdin, Yuhui Wang:
Some further investigation on maximum throughput: Does network coding really help ? ITC 2012: 1-8 - 2011
- [j16]Daniele Catanzaro, Éric Gourdin, Martine Labbé, F. Aykut Özsoy:
A branch-and-cut algorithm for the partitioning-hub location-routing problem. Comput. Oper. Res. 38(2): 539-549 (2011) - [c3]Éric Gourdin, Jasmina Omic, Piet Van Mieghem:
Optimization of network protection against virus spread. DRCN 2011: 86-93 - [c2]Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin:
Cache Location in Tree Networks: Preliminary Results. INOC 2011: 517-522 - 2010
- [j15]Lucile Denoeud-Belgacem, Éric Gourdin, Ruby Krishnaswamy, Adam Ouorou:
Combinatorial auctions for exchanging resources over a grid network. Ann. des Télécommunications 65(11-12): 689-704 (2010) - [j14]Éric Gourdin:
A Mixed Integer Model for the Sparsest Cut problem. Electron. Notes Discret. Math. 36: 111-118 (2010) - [j13]Philippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura:
The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design. Electron. Notes Discret. Math. 36: 867-874 (2010) - [c1]Gabriel Popa, Éric Gourdin, Franck Legendre, Merkourios Karaliopoulos:
On maximizing collaboration in Wireless Mesh Networks without monetary incentives. WiOpt 2010: 402-411 - [p2]Andreas Bley, Bernard Fortz, Éric Gourdin, Kaj Holmberg, Olivier Klopfenstein, Michal Pióro, Artur Tomaszewski, Hakan Ümit:
Optimization of OSPF Routing in IP Networks. Graphs and Algorithms in Communication Networks 2010: 199-240 - [p1]Melanie Moßmann, Jochen Stößer, Adam Ouorou, Éric Gourdin, Ruby Krishnaswamy, Dirk Neumann:
A Combinatorial Exchange for Complex Grid Services. Economic Models and Algorithms for Distributed Systems 2010: 221-237
2000 – 2009
- 2008
- [j12]Alfred Bashllari, Dritan Nace, Éric Gourdin, Olivier Klopfenstein:
Max-min fair survivable networks. Ann. des Télécommunications 63(9-10): 511-522 (2008) - [j11]Éric Gourdin, Olivier Klopfenstein:
Multi-period capacitated location with modular equipments. Comput. Oper. Res. 35(3): 661-682 (2008) - 2007
- [j10]Nathalie Faure, Philippe Chrétienne, Éric Gourdin, Francis Sourd:
Biclique completion problems for multicast network design. Discret. Optim. 4(3-4): 360-377 (2007) - 2006
- [j9]Sylvie Borne, Éric Gourdin, Bernard Liau, Ali Ridha Mahjoub:
Design of survivable IP-over-optical networks. Ann. Oper. Res. 146(1): 41-73 (2006) - [j8]Dritan Nace, Nhat Linh Doan, Éric Gourdin, Bernard Liau:
Computing optimal max-min fair resource allocation for elastic flows. IEEE/ACM Trans. Netw. 14(6): 1272-1281 (2006) - 2005
- [j7]Martine Labbé, Hande Yaman, Éric Gourdin:
A branch and cut algorithm for hub location problems with single assignment. Math. Program. 102(2): 371-405 (2005) - [j6]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, Éric Gourdin, Michael Wolf:
Demonstration with field trails of a satellite-terrestrial synergistic approach for digital multimedia broadcasting to mobile users. IEEE Wirel. Commun. 12(5): 82-90 (2005) - 2003
- [j5]Walid Ben-Ameur, Éric Gourdin:
Internet Routing and Related Topology Issues. SIAM J. Discret. Math. 17(1): 18-49 (2003) - 2000
- [j4]Éric Gourdin, Martine Labbé, Gilbert Laporte:
The Uncapacitated Facility Location Problem with Client Matching. Oper. Res. 48(5): 671-685 (2000)
1990 – 1999
- 1996
- [j3]Éric Gourdin, Brigitte Jaumard, Rachid Ellaia:
Global optimization of Hölder functions. J. Glob. Optim. 8(4): 323-348 (1996) - 1994
- [j2]Éric Gourdin, Pierre Hansen, Brigitte Jaumard:
Finding maximum likelihood estimators for the three-parameter Weibull distribution. J. Glob. Optim. 5(4): 373-397 (1994) - [j1]Éric Gourdin, Brigitte Jaumard, Brenda MacGibbon:
Global Optimization Decomposition Methods for Bounded Parameter Minimax Risk Evaluation. SIAM J. Sci. Comput. 15(1): 16-35 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
