| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143341 | Operations Research Letters | 2006 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Geir Dahl, David Huygens, A. Ridha Mahjoub, Pierre Pesneau,