L. Nácher, M. Baldomero Naranjo, M. Landete, M. Leal

This work presents a novel mixed integer linear programming framework that integrates facility location with the simultaneous construction of hierarchical clustering. By using a distance matrix for location and a dissimilarity matrix for clustering, the model captures the interdependence between where facilities are placed and the hierarchical clustering structures that emerge within the groups assigned to each facility. Several formulations are developed to incorporate single-linkage and complete-linkage clustering in the location-allocation problem, enabling a comparative analysis of how different hierarchical criteria influence the integrated problem. The approach is validated through a case study that illustrates its behavior and the consistency between the assignment decisions and the resulting hierarchical structure.

Keywords: Facility location, Hierarchical clustering, Mixed-integer programming

Scheduled

GT GELOCA 3: Covering models and clustering approaches in location
September 4, 2026  11:10 AM
Aula B


Other papers in the same session

The Clustered Multimode Set Covering Location Problem

A. MANCUSO, A. M. Rodríguez Chía, F. Saldanha-da-Gama, C. Sterle

Machine Learning-Guided Matheuristics for the Covering Tour Problem with Path Upgrades

D. Amitrano, M. Baldomero Naranjo, M. Boccia, A. Mancuso, A. Masone, A. M. Rodríguez Chía, C. Sterle

Windy Drone Coverage Path Planning with variable heights

C. Valverde Martín, J. Puerto Albandoz, L. Amorosi, P. Dell'Olmo


Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.