A Hybrid Classical-Quantum Approach for Multi-Constrained Location Optimization Problem
Source: Originally published on arXiv quant-ph on July 21, 2026.
arXiv:2607.16277v1 Announce Type: new Abstract: The Maximal Covering Location Problem (MCLP) is an NP-hard Combinatorial Optimization Problem (COP) that aims to determine the optimal facility placements that maximize total coverage. It is characterized by both equality and inequality constraints, which ensure correct coverage but significantly increase the complexity of exploring the solution space as instance size grows. Hybrid quantum-classical approaches might offer a promising alternative to classical optimization methods by enabling the exploration of complex energy landscapes through quantum superposition and probabilistic sampling. In this work, the MCLP is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) model, where constraint embedding plays a critical role in s...
To read the full article, visit the original source page: