Hervé Kerivin

32 papers C 4Journal 27
YearRankTypeTitle / Venue / Authors
2026 J jnl
A polyhedral study of a relaxation of the routing and spectrum allocation problem.
Discret. Appl. Math.
Federico Bertero, Hervé Kerivin, Javier Marenco, Annegret K. Wagler
2026 J jnl
Routing and Spectrum Assignment in Elastic Optical Networks integrating Quality of Transmission requirements.
Eur. J. Oper. Res.
Pedro Henrique Fernandes da Silva, Hervé Kerivin, Michel Morvan, Annegret K. Wagler
2024 J jnl
On non-superperfection of edge intersection graphs of paths.
Discret. Optim.
Victoria Kaial, Hervé Kerivin, Annegret K. Wagler
2024 J jnl
Solving the routing and spectrum assignment problem, driven by combinatorial properties.
Networks
Pedro Henrique Fernandes da Silva, Hervé Kerivin, Juan Pablo Nant, Annegret K. Wagler
2023 C conf
A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement).
LAGOS
Federico Bertero, Hervé Kerivin, Javier Marenco, Annegret K. Wagler
2023 J jnl
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem.
Eur. J. Oper. Res.
Mourad Baïou, Rafael Colares, Hervé Kerivin
2023 J jnl
Practical methods for allocating and assessing resources in flexgrid networks.
JOCN
Hussein Chouman, Luay Alahdab, Rafael Colares, Annie Gravey, Philippe Gravey, Hervé Kerivin, Michel Morvan
2022 J jnl
A computational study on the Maximum-Weight Bounded-Degree Rooted Tree Problem.
Appl. Math. Comput.
Hervé Kerivin, Jinhua Zhao
2022 J jnl
The complexity of the unit stop number problem and its implications to other related problems.
Theor. Comput. Sci.
Mourad Baïou, Rafael Colares, Hervé Kerivin
2019 C conf
A novel integer linear programming model for routing and spectrum assignment in optical networks.
FedCSIS
Youssouf Hadhbi, Hervé Kerivin, Annegret K. Wagler
2018 J jnl
Minimal arc-sets spanning dicycles.
Discret. Appl. Math.
Denis Cornaz, Hervé Kerivin, Ali Ridha Mahjoub
2018 J jnl
On the Chvátal-rank of facets for the set covering polyhedron of circular matrices.
Electron. Notes Discret. Math.
Graciela L. Nasini, Luis Miguel Torres, Hervé Kerivin, Annegret K. Wagler
2018 C conf
The Stop Number Minimization Problem: Complexity and Polyhedral Analysis.
ISCO
Mourad Baïou, Rafael Colares, Hervé Kerivin
2014 C conf
Polyhedral study for the maximum bounded r-tree problem.
CoDIT
Hervé Kerivin, Jinhua Zhao
2012 J jnl
Models for the single-vehicle preemptive pickup and delivery problem.
J. Comb. Optim.
Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub
2012 J jnl
On the complexity of the Eulerian closed walk with precedence path constraints problem.
Theor. Comput. Sci.
Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub
2011 J jnl
Maximum Bounded Rooted-Tree Packing Problem
CoRR
Hervé Kerivin, Jimmy Leblet, Gwendal Simon, Fen Zhou
2011 J jnl
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem.
RAIRO Oper. Res.
Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint
2010 J jnl
On the complexity of the Eulerian closed walk with precedence path constraints problem.
Electron. Notes Discret. Math.
Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub
2010 J jnl
Tree based heuristics for the preemptive asymmetric stacker crane problem.
Electron. Notes Discret. Math.
Alain Quilliot, Mathieu Lacroix, Hélène Toussaint, Hervé Kerivin
2009 J jnl
A note on the data-driven capacity of P2P networks
CoRR
Jacob Chakareski, Pascal Frossard, Hervé Kerivin, Jimmy Leblet, Gwendal Simon
2008 J jnl
On the Polytope of the (1, 2)-Survivable Network Design Problem.
SIAM J. Discret. Math.
Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub
2007 J jnl
A branch-and-cut algorithm for a resource-constrained scheduling problem.
RAIRO Oper. Res.
Renaud Sirdey, Hervé Kerivin
2007 J jnl
On a resource-constrained scheduling problem with application to distributed systems reconfiguration.
Eur. J. Oper. Res.
Renaud Sirdey, Jacques Carlier, Hervé Kerivin, Dritan Nace
2005 J jnl
Design of Survivable Networks: A survey.
Networks
Hervé Kerivin, Ali Ridha Mahjoub
2005 J jnl
Design of capacitated survivable networks with a single facility.
IEEE/ACM Trans. Netw.
Hervé Kerivin, Dritan Nace, Thi-Tuyet-Loan Pham
2005 J jnl
On survivable network polyhedra.
Discret. Math.
Hervé Kerivin, Ali Ridha Mahjoub
2004 — ch.
(1, 2)-Survivable Networks: Facets and Branch-and-Cut.
The Sharpest Cut
Hervé Kerivin, Ali Ridha Mahjoub, Charles Nocq
2004 J jnl
Separation of partition inequalities with terminals.
Discret. Optim.
Francisco Barahona, Hervé Kerivin
2003 J jnl
Networks new economical virtual private.
Commun. ACM
Walid Ben-Ameur, Hervé Kerivin
2002 J jnl
Separation of partition inequalities for the (1, 2)-survivable network design problem.
Oper. Res. Lett.
Hervé Kerivin, Ali Ridha Mahjoub
2001 J jnl
Steiner trees and polyhedra.
Discret. Appl. Math.
Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub