par Dahl, Geir;Huygens, David 
;Mahjoub, Ali Ridha;Pesneau, Pierre
Référence Operations research letters, 34, 5, page (577-582)
Publication Publié, 2006-09
;Mahjoub, Ali Ridha;Pesneau, PierreRéférence Operations research letters, 34, 5, page (577-582)
Publication Publié, 2006-09
Article révisé par les pairs
| Résumé : | The k edge-disjoint 2-hop-constrained paths problem consists in finding a minimum cost subgraph such that between two given nodes s and t there exist at least k edge-disjoint paths of at most 2 edges. We give an integer programming formulation for this problem and characterize the associated polytope. © 2005 Elsevier B.V. All rights reserved. |
