Consider an undirected graph G(V,E), where each edge $e\in E$ has capacity $c(e)$.  Also given is a traffic matrix $T_{ij}$ representing the amount of traffic flowing from vertex $i$ to $j$.  The goal is to minimize the number of links required to support all traffic in $T_{ij}$ such that the total traffic traversing each link $e$ is less than $c(e)$.Is there an equivalent problem in the literature? thanks,kwan
Laying paths on a network using minimum number of links/edges
reference request;graph theory;optimization;network modeling