We introduce new classes of facet-defining inequalities for the polytope P pd associated with the set packing formulation of the simple plant location problem (SPLP) with p plants and d destinations. The inequalities are obtained by identifying subgraphs of the intersection graph G(p,d) of SPLP that are facet-defining, and lifting their associated facets if it is necessary. To this end, we find subfamilies of previously known structured families of facet-defining graphs, like fans and wheels, inside G(p,d). We also characterize a class of facets of SPLP and summarize the previous polyhedral results on this problem. © 2002 Elsevier Science B.V.
Cánovas, L., Landete, M., & Marn, A. (2002). On the facets of the simple plant location packing polytope. Discrete Applied Mathematics, 124(1–3), 27–53. https://doi.org/10.1016/S0166-218X(01)00328-6