A branch and bound algorithm for the partial coverage capacitated plant location problem

In this paper, a branch and bound algorithm for the partial coverage capacitated facility locations problem is developed. We have to fix open a set of warehouses which are economically feasible. It is an extension of the algorithm given by Khumawala and Arora & Arora. The case when the demand of the customer may not be satisfied completely, giving rise to ‘opportunity demand’ is also discussed. This is illustrated with the help of examples and their computational results.