Integer programming formulations for the two 4‐hop‐constrained paths problem
David Huygens, Ali Ridha Mahjoub · Networks · 2006
Abstract In 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