A branch and bound approach for the capacitated plant location problem using cuts from the partial convex hull

Abstract

The efficient solution of capacitated plant location problems usually requires the development of specific software mainly when the problems are pure integer ones, standard mathematical programming codes being highly inefficient. The normal formulation of these problems includes different kinds of constraints which are of knapsack type. This fact can be used in connection with the procedures developped by Balas, Padberg and others, of computing facets of the knapsack polytopes. Procedures which can be used with a standard mathematical programming code are described and computational experience is reported.