On the k edge-disjoint 2-hop-constrained paths polytope

On the k edge-disjoint 2-hop-constrained paths polytope

0.00 Avg rating0 Votes
Article ID: iaor2007923
Country: Netherlands
Volume: 34
Issue: 5
Start Page Number: 577
End Page Number: 582
Publication Date: Sep 2006
Journal: Operations Research Letters
Authors: , , ,
Abstract:

The k edge-disjoint 1-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 polytype.

Reviews

Required fields are marked *. Your email address will not be published.