A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The k edge-disjoint 3-hop-constrained paths polytope
2010
Discrete Optimization
Given a graph G with two distinguished nodes s and t, a cost on each edge of G and two fixed integers k ≥ 2, L ≥ 2, the k edge-disjoint L-hop-constrained paths problem is to find a minimum cost subgraph of G such that between s and t there are at least k edge-disjoint paths of length at most L. In this paper we consider this problem from a polyhedral point of view. We give an integer programming formulation for the problem and discuss the associated polytope. In particular, we show that when L
doi:10.1016/j.disopt.2010.05.001
fatcat:44dbxsqhsbcghimhauypucbip4