An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem

Abstract

This paper describes an efficient solution procedure for the warehouse location problem in which limitations on the amount of goods which can be handled are also imposed. The proposed branch-and-bound solution method is made efficient by developing dominance, lower and upper bounding procedures and branch and node selection rules utilizing the special structure of this problem. Computational results are provided for large sized problems.