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

Dahl, G;Huygens, D;Mahjoub, AR;Pesneau, P
(2006) Operations Research Letters — Vol. 34, n° 5, p. 577-582 (2006)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 166.29 KB
No access

Details

Authors
  • Dahl, G
    Author
  • Huygens, D
    Author
  • Mahjoub, AR
    Author
  • Pesneau, P
    Author
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. (c) 2005 Elsevier B.V. All rights reserved.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Dahl, G., Huygens, D., Mahjoub, A., & Pesneau, P. (2006). On the k edge-disjoint 2-hop-constrained paths polytope. Operations Research Letters, 34(5), 577-582. https://doi.org/10.1016/j.orl.2005.09.001 (Original work published 2006)