 | 2009 |
|---|
| 9 |       | Jacob Chakareski,
Pascal Frossard,
Hervé Kerivin,
Jimmy Leblet,
Gwendal Simon:
A note on the data-driven capacity of P2P networks
CoRR abs/0909.3122: (2009) |
| 2007 |
|---|
| 8 | | Renaud Sirdey,
Jacques Carlier,
Hervé Kerivin,
Dritan Nace:
On a resource-constrained scheduling problem with application to distributed systems reconfiguration.
European Journal of Operational Research 183(2): 546-563 (2007) |
| 2005 |
|---|
| 7 | | Hervé Kerivin,
Ali Ridha Mahjoub:
On survivable network polyhedra.
Discrete Mathematics 290(2/3): 183-210 (2005) |
| 6 | | Hervé Kerivin,
Dritan Nace,
Thi-Tuyet-Loan Pham:
Design of capacitated survivable networks with a single facility.
IEEE/ACM Trans. Netw. 13(2): 248-261 (2005) |
| 5 | | Hervé Kerivin,
Ali Ridha Mahjoub:
Design of Survivable Networks: A survey.
Networks 46(1): 1-21 (2005) |
| 2004 |
|---|
| 4 | | Francisco Barahona,
Hervé Kerivin:
Separation of partition inequalities with terminals.
Discrete Optimization 1(2): 129-140 (2004) |
| 2003 |
|---|
| 3 | | Walid Ben-Ameur,
Hervé Kerivin:
Networks new economical virtual private.
Commun. ACM 46(6): 69-73 (2003) |
| 2002 |
|---|
| 2 | | Hervé Kerivin,
Ali Ridha Mahjoub:
Separation of partition inequalities for the (1, 2)-survivable network design problem.
Oper. Res. Lett. 30(4): 265-268 (2002) |
| 2001 |
|---|
| 1 |  | Mohamed Didi Biha,
Hervé Kerivin,
Ali Ridha Mahjoub:
Steiner trees and polyhedra.
Discrete Applied Mathematics 112(1-3): 101-120 (2001) |
