Hervé Kerivin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 26 from 26

2024

Solving the routing and spectrum assignment problem, driven by combinatorial propertiesPedro H. Fernandes da Silva, Hervé Kerivin, Juan Pablo Nant, Annegret Katrin Wagler. networks, 83(2):390-407, March 2024. [doi]

2023

2022

The complexity of the unit stop number problem and its implications to other related problemsMourad Baïou, Rafael Colares, Hervé Kerivin. TCS, 919:36-46, 2022. [doi]

A computational study on the Maximum-Weight Bounded-Degree Rooted Tree ProblemHervé Kerivin, Jinhua Zhao. amc, 413:126623, 2022. [doi]

2019

A novel integer linear programming model for routing and spectrum assignment in optical networksYoussouf Hadhbi, Hervé Kerivin, Annegret Wagler. FedCSIS 2019: 127-134 [doi]

2018

The Stop Number Minimization Problem: Complexity and Polyhedral AnalysisMourad Baïou, Rafael Colares, Hervé Kerivin. iscopt 2018: 64-76 [doi]

Minimal arc-sets spanning dicyclesDenis Cornaz, Hervé Kerivin, Ali Ridha Mahjoub. DAM, 240:33-43, 2018. [doi]

On the Chvátal-rank of facets for the set covering polyhedron of circular matricesGraciela L. Nasini, Luis Miguel Torres, Hervé Kerivin, Annegret Wagler. endm, 69:85-92, 2018. [doi]

2014

Polyhedral study for the maximum bounded r-tree problemHervé Kerivin, Jinhua Zhao. codit 2014: 140-145 [doi]

2012

Models for the single-vehicle preemptive pickup and delivery problemHervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub. jco, 23(2):196-223, 2012. [doi]

On the complexity of the Eulerian closed walk with precedence path constraints problemHervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub. TCS, 439:16-29, 2012. [doi]

2011

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problemHervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint. rairo, 45(3):179-207, 2011. [doi]

2010

On the complexity of the Eulerian closed walk with precedence path constraints problemHervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub. endm, 36:899-906, 2010. [doi]

Tree based heuristics for the preemptive asymmetric stacker crane problemAlain Quilliot, Mathieu Lacroix, Hélène Toussaint, Hervé Kerivin. endm, 36:41-48, 2010. [doi]

2007

A branch-and-cut algorithm for a resource-constrained scheduling problemRenaud Sirdey, Hervé Kerivin. rairo, 41(3):235-251, 2007. [doi]

On a resource-constrained scheduling problem with application to distributed systems reconfigurationRenaud Sirdey, Jacques Carlier, Hervé Kerivin, Dritan Nace. eor, 183(2):546-563, 2007. [doi]

2005

Design of capacitated survivable networks with a single facilityHervé Kerivin, Dritan Nace, Thi Tuyet Loan Pham. ton, 13(2):248-261, 2005. [doi]

On survivable network polyhedraHervé Kerivin, Ali Ridha Mahjoub. DM, 290(2/3):183-210, 2005. [doi]

Design of Survivable Networks: A surveyHervé Kerivin, Ali Ridha Mahjoub. networks, 46(1):1-21, 2005. [doi]

2004

Separation of partition inequalities with terminalsFrancisco Barahona, Hervé Kerivin. disopt, 1(2):129-140, 2004. [doi]

(1, 2)-Survivable Networks: Facets and Branch-and-CutHervé Kerivin, Ali Ridha Mahjoub, Charles Nocq. In Martin Grötschel, editor, The Sharpest Cut. Volume 4 of MPS-SIAM series on optimization, pages 121-152, SIAM, 2004. [doi]

2003

Networks new economical virtual privateWalid Ben-Ameur, Hervé Kerivin. CACM, 46(6):69-73, 2003. [doi]

2002

Separation of partition inequalities for the (1, 2)-survivable network design problemHervé Kerivin, Ali Ridha Mahjoub. orl, 30(4):265-268, 2002. [doi]

2001

Steiner trees and polyhedraMohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub. DAM, 112(1-3):101-120, 2001.

Sign in or sign up to see more results.

runs on WebDSL