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.
[1] T. L. Ray,et al. A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..
[2] B. M. Khumawala. An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .
[3] Abraham Warszawski,et al. Multi-Dimensional Location Problems , 1973 .