Optimal traffic flow schedules in a semi-parallel tree network

Scheduling of traffic through a tree-structured model under a semi-parallel constraint is considered. The problem of finding the optimal root without resort to exhaustive search is studied. Several sufficient conditions to exclude a node as a optimal root candidate are presented.