New Variants of the Simple Plant Location Problem and Applications.

This work revisits novel variants of the Simple Plant Location Problem (SPLP), which were originally pre-sented 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 effec-tiveness 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 telecom-munication networks and interesting connections in the field of Genetics, and also by the analysis of open questions and future research directions.(c) 2022 Elsevier B.V. All rights reserved.