A Note on Warszawski's Multi-Commodity Location Problem

This note shows two easily incorporated improvements in computing the lower bounds for Warszawski's branch and bound algorithm for the multi-commodity location problem. The lower bounds become relatively stronger, thereby making the branch and bound algorithm more efficient.