Hervé Kerivin

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 11

Top Topics

Integer Linear Programming

Intersection Points

Complexity Theoretic

Positive Semidefinite

Top Venues

Discret. Optim.

Discret. Appl. Math.

Publications

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