Abstract
AbstractIn this article, we consider the two 4‐hop‐constrained paths problem, which consists, given a graph G = (N,E) and two nodes s,t ∈ N, of finding a minimum cost subgraph in G containing at least two node‐ (resp., edge‐) disjoint paths of length at most 4 between s and t. We give integer programming formulations, in the space of the design variables, for both the node and edge versions of this problem. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(2), 135–144 2007
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
