 | 2012 |
| 15 |  | Hervé Kerivin,
Mathieu Lacroix,
Ali Ridha Mahjoub:
Models for the single-vehicle preemptive pickup and delivery problem.
J. Comb. Optim. 23(2): 196-223 (2012) |
| 2011 |
| 14 |  | Hervé Kerivin,
Jimmy Leblet,
Gwendal Simon,
Fen Zhou:
Maximum Bounded Rooted-Tree Packing Problem
CoRR abs/1111.0706: (2011) |
| 13 |  | Hervé Kerivin,
Mathieu Lacroix,
Alain Quilliot,
Hélène Toussaint:
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem.
RAIRO - Operations Research 45(3): 179-207 (2011) |
| 2010 |
| 12 |  | Alain Quilliot,
Mathieu Lacroix,
Hélène Toussaint,
Hervé Kerivin:
Tree based heuristics for the preemptive asymmetric stacker crane problem.
Electronic Notes in Discrete Mathematics 36: 41-48 (2010) |
| 11 |  | Hervé Kerivin,
Mathieu Lacroix,
Ali Ridha Mahjoub:
On the complexity of the Eulerian closed walk with precedence path constraints problem.
Electronic Notes in Discrete Mathematics 36: 899-906 (2010) |
| 2009 |
| 10 |  | 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) |
| 2008 |
| 9 |  | Mohamed Didi Biha,
Hervé Kerivin,
Ali Ridha Mahjoub:
On the Polytope of the (1, 2)-Survivable Network Design Problem.
SIAM J. Discrete Math. 22(4): 1640-1666 (2008) |
| 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) |