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)

Mr. Jack Pendray is Executive in Residence and Visiting Professor of Management at George Mason University, Fairfax, Virginia. From 1993-96, Jack was President of the International Group of Cincinnati Bell Information Systems Inc., Cincinnati OH, where he was responsible for all non-North...