Éric Gourdin

	2011
14		Éric Gourdin, Jasmina Omic, Piet Van Mieghem: Optimization of network protection against virus spread. DRCN 2011: 86-93
13		Pierre Bauguion, Walid Ben-Ameur, Éric Gourdin: Cache Location in Tree Networks: Preliminary Results. INOC 2011: 517-522
12		Daniele Catanzaro, Éric Gourdin, Martine Labbé, F. Aykut Özsoy: A branch-and-cut algorithm for the partitioning-hub location-routing problem. Computers & OR 38(2): 539-549 (2011)
	2010
11		Gabriel Popa, Éric Gourdin, Franck Legendre, Merkourios Karaliopoulos: On maximizing collaboration in Wireless Mesh Networks without monetary incentives. WiOpt 2010: 402-411
10		Lucile Denoeud-Belgacem, Éric Gourdin, Ruby Krishnaswamy, Adam Ouorou: Combinatorial auctions for exchanging resources over a grid network. Annales des Télécommunications 65(11-12): 689-704 (2010)
9		Éric Gourdin: A Mixed Integer Model for the Sparsest Cut problem. Electronic Notes in Discrete Mathematics 36: 111-118 (2010)
8		Philippe Chrétienne, Pierre Fouilhoux, Éric Gourdin, Jean-Mathieu Segura: The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design. Electronic Notes in Discrete Mathematics 36: 867-874 (2010)
	2008
7		Alfred Bashllari, Dritan Nace, Éric Gourdin, Olivier Klopfenstein: Max-min fair survivable networks. Annales des Télécommunications 63(9-10): 511-522 (2008)
6		Éric Gourdin, Olivier Klopfenstein: Multi-period capacitated location with modular equipments. Computers & OR 35(3): 661-682 (2008)
	2007
5		Nathalie Faure, Philippe Chrétienne, Éric Gourdin, Francis Sourd: Biclique completion problems for multicast network design. Discrete Optimization 4(3-4): 360-377 (2007)
	2006
4		Sylvie Borne, Éric Gourdin, Bernard Liau, Ali Ridha Mahjoub: Design of survivable IP-over-optical networks. Annals OR 146(1): 41-73 (2006)
3		Dritan Nace, Nhat Linh Doan, Éric Gourdin, Bernard Liau: Computing optimal max-min fair resource allocation for elastic flows. IEEE/ACM Trans. Netw. 16(6): 1272-1281 (2006)
	2005
2		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)
	2003
1		Walid Ben-Ameur, Éric Gourdin: Internet Routing and Related Topology Issues. SIAM J. Discrete Math. 17(1): 18-49 (2003)

Coauthor Index

1	Alfred Bashllari	[7]
2	Pierre Bauguion	[13]
3	Walid Ben-Ameur	[1] [13]
4	Sylvie Borne	[4]
5	Daniele Catanzaro	[12]
6	Philippe Chrétienne	[5] [8]
7	Lucile Denoeud-Belgacem	[10]
8	Nhat Linh Doan	[3]
9	Nathalie Faure	[5]
10	Pierre Fouilhoux	[8]
11	Merkourios Karaliopoulos	[11]
12	Olivier Klopfenstein	[6] [7]
13	Ruby Krishnaswamy	[10]
14	Martine Labbé	[2] [12]
15	Franck Legendre	[11]
16	Bernard Liau	[3] [4]
17	Ali Ridha Mahjoub	[4]
18	Piet Van Mieghem	[14]
19	Dritan Nace	[3] [7]
20	Jasmina Omic	[14]
21	Adam Ouorou	[10]
22	F. Aykut Özsoy	[12]
23	Gabriel Popa	[11]
24	Jean-Mathieu Segura	[8]
25	Francis Sourd	[5]
26	Hande Yaman	[2]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page