Hervé Kerivin

According to our database, Hervé Kerivin authored at least 32 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Solving the routing and spectrum assignment problem, driven by combinatorial properties.

Pedro Henrique Fernandes da Silva, Hervé Kerivin, Juan Pablo Nant, Annegret Katrin Wagler

Networks, March, 2024

On non-superperfection of edge intersection graphs of paths.

Victoria Kaial, Hervé Kerivin, Annegret Katrin Wagler

Discret. Optim., 2024

2023

Complexity, algorithmic, and computational aspects of a dial-a-ride type problem.

Mourad Baïou, Rafael Colares, Hervé Kerivin

Eur. J. Oper. Res., October, 2023

Practical methods for allocating and assessing resources in flexgrid networks.

Hussein Chouman, Luay Alahdab, Rafael Colares, Annie Gravey, Philippe Gravey, Hervé Kerivin, Michel Morvan

JOCN, 2023

A polyhedral study of a relaxation of the routing and spectrum allocation problem (Brief Announcement).

Federico Bertero, Hervé Kerivin, Javier Marenco, Annegret Wagler

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

The complexity of the unit stop number problem and its implications to other related problems.

Mourad Baïou, Rafael Colares, Hervé Kerivin

Theor. Comput. Sci., 2022

Bounded-degree rooted tree and TDI-ness.

Hervé L. M. Kerivin, Jinhua Zhao

RAIRO Oper. Res., 2022

A computational study on the Maximum-Weight Bounded-Degree Rooted Tree Problem.

Hervé Kerivin, Jinhua Zhao

Appl. Math. Comput., 2022

2019

A novel integer linear programming model for routing and spectrum assignment in optical networks.

Youssouf Hadhbi, Hervé Kerivin, Annegret Wagler

Proceedings of the 2019 Federated Conference on Computer Science and Information Systems, 2019

2018

On the Chvátal-rank of facets for the set covering polyhedron of circular matrices.

Graciela L. Nasini, Luis Miguel Torres, Hervé Kerivin, Annegret Wagler

Electron. Notes Discret. Math., 2018

Minimal arc-sets spanning dicycles.

Denis Cornaz, Hervé Kerivin, Ali Ridha Mahjoub

Discret. Appl. Math., 2018

Robust multiobjective optimization with application to Internet routing.

Erin K. Doolittle, Hervé L. M. Kerivin, Margaret M. Wiecek

Ann. Oper. Res., 2018

The Stop Number Minimization Problem: Complexity and Polyhedral Analysis.

Mourad Baïou, Rafael Colares, Hervé Kerivin

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2015

Polyhedral study of the connected subgraph problem.

Mohamed Didi Biha, Hervé L. M. Kerivin, Peh H. Ng

Discret. Math., 2015

2014

Polyhedral study for the maximum bounded r-tree problem.

Hervé Kerivin, Jinhua Zhao

Proceedings of the International Conference on Control, 2014

2012

On the complexity of the Eulerian closed walk with precedence path constraints problem.

Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub

Theor. Comput. Sci., 2012

Models for the single-vehicle preemptive pickup and delivery problem.

Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub

J. Comb. Optim., 2012

2011

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem.

Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint

RAIRO Oper. Res., 2011

Maximum Bounded Rooted-Tree Packing Problem

Hervé Kerivin, Jimmy Leblet, Gwendal Simon, Fen Zhou

CoRR, 2011

2010

Tree based heuristics for the preemptive asymmetric stacker crane problem.

Alain Quilliot, Mathieu Lacroix, Hélène Toussaint, Hervé Kerivin

Electron. Notes Discret. Math., 2010

2009

A note on the data-driven capacity of P2P networks

Jacob Chakareski, Pascal Frossard, Hervé Kerivin, Jimmy Leblet, Gwendal Simon

CoRR, 2009

2008

On the Polytope of the (1, 2)-Survivable Network Design Problem.

Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub

SIAM J. Discret. Math., 2008

2007

A branch-and-cut algorithm for a resource-constrained scheduling problem.

Renaud Sirdey, Hervé Kerivin

RAIRO Oper. Res., 2007

On a resource-constrained scheduling problem with application to distributed systems reconfiguration.

Renaud Sirdey, Jacques Carlier, Hervé Kerivin, Dritan Nace

Eur. J. Oper. Res., 2007

2005

Design of capacitated survivable networks with a single facility.

Hervé Kerivin, Dritan Nace, Thi-Tuyet-Loan Pham

IEEE/ACM Trans. Netw., 2005

Design of Survivable Networks: A survey.

Hervé Kerivin, Ali Ridha Mahjoub

Networks, 2005

On survivable network polyhedra.

Hervé Kerivin, Ali Ridha Mahjoub

Discret. Math., 2005

2004

Separation of partition inequalities with terminals.

Francisco Barahona, Hervé Kerivin

Discret. Optim., 2004

(1, 2)-Survivable Networks: Facets and Branch-and-Cut.

Hervé Kerivin, Ali Ridha Mahjoub, Charles Nocq

Proceedings of the Sharpest Cut, 2004

2003

Networks new economical virtual private.

Walid Ben-Ameur, Hervé Kerivin

Commun. ACM, 2003

2002

Separation of partition inequalities for the (1, 2)-survivable network design problem.

Hervé Kerivin, Ali Ridha Mahjoub

Oper. Res. Lett., 2002

2001

Steiner trees and polyhedra.

Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub

Discret. Appl. Math., 2001