| Abstract: | This paper introduces an efficient heuristic procedure for solving a special class of mixed integer programming problem called the capacitated warehouse (plant) location problem. This procedure parallels the work reported earlier in 9] on the uncapacitated warehouse location problem. The procedure can be viewed as tracing a judiciously selected path of the branch and bound tree (from the initial node to the terminal node) to arrive at a candidate solution. A simple backtracking scheme is also incorporated in the procedure to investigate possible improvement in the solution. Computational results on problems found in the literature look quite encouraging. |
