Cabral, Edgar Alberto - 2013
The network design problem with relays (NDPR) is defined on an undirected graph G = (V, E, K), where V = {1, … , n} is a vertex set, E = {(i, j) : i, j ∈ V, i j} is an edge set. The set K = {(o(k), d(k))} is a set of communication pairs (or commodities): o(k) ∈ V and d(k) ∈ V denote the...