par Huygens, David ;Mahjoub, Ali Ridha
Référence Networks, 49, 2, page (135-144)
Publication Publié, 2007-03
Article révisé par les pairs
Résumé : In this article, we consider the two 4-hop-constrained paths problem, which consists, given a graph G = (N, E) and two nodes s, t ∈ N, of finding a minimum cost subgraph in G containing at least two node- (resp., edge-) disjoint paths of length at most 4 between s and t. We give integer programming formulations, in the space of the design variables, for both the node and edge versions of this problem. © 2006 wiley Periodicals, Inc.