Showing 1 - 10 of 28
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
Persistent link: https://www.econbiz.de/10005253347
Persistent link: https://www.econbiz.de/10004147408
Persistent link: https://www.econbiz.de/10006648119
Persistent link: https://www.econbiz.de/10006654115
Persistent link: https://www.econbiz.de/10005287706
Persistent link: https://www.econbiz.de/10003534452
Persistent link: https://www.econbiz.de/10005240901
Persistent link: https://www.econbiz.de/10005329681
Persistent link: https://www.econbiz.de/10005253835