Abstract: The method defines a distribution solution for supplying product to a pluity of loads from a plurality of sources via a network of substantially linear path segments that are interconnected at nodes. A combination of minimum spanning trees (MST) and a shortest-path tree (SPT) are applied to the network to form a composite path. The resulting composite path defines a plurality of closed-loop paths in the network. Excluded from consideration in the distribution solution are any of the path segments not included in the composite path. All closed-loop paths are then eliminated by excluding from consideration the one or more path segments having a total weight value that is greatest from each of the closed-loop paths. As a result, a composite tree is defined. The composite tree is then redefined by excluding from consideration in the distribution solution any of the path segments of the composite tree that are not part of a path linking one of the sources to one of the loads.