This paper introduces an efficient branch and bound algorithm for a special class of mixed integer programming problems called the warehouse location problem. A set of branching decision rules is ...

We show through computational experiments that the second pricing mechanism performs better than the first to compute the linear programming relaxation lower bound. We then embed it within a ...