Showing 1 - 1 of 1
We present a two-phase heuristic for designing a capacitated degree constrained min sum arborescence. For a given directed graph G(V,E) where V={0, 1,…,n} with nonnegative costs Cij for each (i,j)
Persistent link: https://www.econbiz.de/10011210137