A branch-and-bound algorithm for the supply connected location-allocation problem on networks

The Supply Connected Location-Allocation Problem (SCLAP) involves locating p facilities with respect to n demand points and a supply plant. The supply plant produces all material and ships it in bulk to facilities along a route to be determined. Facilities then distribute the material to demand points. In this paper, we formulate SCLAP on networks and develop a single assignment branch-and-bound algorithm to solve the problem. We also present discussions on computational results.