arXiv · 2611.21942
Projector-Based Conic Formulations and Exact Decompositions for Continuous Multifacility Location
Abstract
We study the continuous multisource facility location problem, where facility locations and the assignment of demand points must be determined simultaneously. We show that the assignment structure can be represented by orthogonal projection matrices. This observation leads to new mixed-projection conic formulations that avoid the big-M envelopes used in standard mixed-integer models. Based on these formulations, we develop exact decomposition algorithms that separate the discrete selection of the assignment projectors from location convex conic subproblems. We also derive semidefinite relaxation bounds and primal procedures that provide warm starts for the exact methods. The proposed approach draws new connections between continuous multifacility location, orthogonal projectors, and low-rank semidefinite optimization, and applies to general conic-representable distances.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Víctor Blanco, Diego Laborda-Gutiérrez, Miguel Martínez-Antón. 2026-11-16. Projector-Based Conic Formulations and Exact Decompositions for Continuous Multifacility Location. https://searcharxiv.com/abs/2611.21942
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.