Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Hervé
    Last name: Kerivin
    DBLP: 84/768
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 10 of 10  
    Select a publication
    Show Title Venue Rating Date
    Jacob Chakareski, Pascal Frossard, Hervé Kerivin, Jimmy Leblet, Gwendal Simon.
    A note on the data-driven capacity of P2P networks
    CoRR 2009, Volume 0 (0) 2009
    Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub.
    On the Polytope of the (1, 2)-Survivable Network Design Problem.
    SIAM J. Discrete Math. 2008, Volume 22 (0) 2008
    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 2007, Volume 183 (0) 2007
    Hervé Kerivin, Ali Ridha Mahjoub.
    On survivable network polyhedra.
    Discrete Mathematics 2005, Volume 290 (0) 2005
    Hervé Kerivin, Ali Ridha Mahjoub.
    Design of Survivable Networks: A survey.
    Networks 2005, Volume 46 (0) 2005
    Hervé Kerivin, Dritan Nace, Thi-Tuyet-Loan Pham.
    Design of capacitated survivable networks with a single facility.
    IEEE/ACM Trans. Netw. 2005, Volume 13 (0) 2005
    Francisco Barahona, Hervé Kerivin.
    Separation of partition inequalities with terminals.
    Discrete Optimization 2004, Volume 1 (0) 2004
    Walid Ben-Ameur, Hervé Kerivin.
    Networks new economical virtual private.
    Commun. ACM 2003, Volume 46 (0) 2003
    Hervé Kerivin, Ali Ridha Mahjoub.
    Separation of partition inequalities for the (1, 2)-survivable network design problem.
    Oper. Res. Lett. 2002, Volume 30 (0) 2002
    Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub.
    Steiner trees and polyhedra.
    Discrete Applied Mathematics 2001, Volume 112 (0) 2001

    Your query returned 10 matches in the database.