Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
