Abstract
This work revisits novel variants of the Simple Plant Location Problem (SPLP), which were originally presented in the Ph.D. thesis Set packing, location and related problems (2019). They consist in considering different requirements on clients allocation to facilities, namely incompatibilities or co-location for some specific pairs of clients. These correspond to “cannot-link” and “must-link” constraints previously studied in the related topic of clustering. Set packing formulations of these new location problems are presented, together with families of valid inequalities and facets. Computational experience supporting the effectiveness of the resulting cuts into a branch and cut procedure is exposed. The comprehensive revision on these new variants of the SPLP is completed by illustrative applications, including the design of telecommunication networks and interesting connections in the field of Genetics, and also by the analysis of open questions and future research directions.
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.
