Continuous maximal covering location problems with interconnected facilities

DOI10.1016/J.COR.2021.105310arXiv2005.03274MaRDI QIDQ6340221FDOQ6340221

Publication date: 7 May 2020

Abstract: In this paper we analyze a continuous version of the maximal covering location problem, in which the facilities are required to be interconnected by means of a graph structure in which two facilities are allowed to be linked if a given distance is not exceed. We provide a mathematical programming framework for the problem and different resolution strategies. First, we propose a Mixed Integer Non Linear Programming formulation, and derive properties of the problem that allow us to project the continuous variables out avoiding the nonlinear constraints, resulting in an equivalent pure integer programming formulation. Since the number of constraints in the integer programming formulation is large and the constraints are, in general, difficult to handle, we propose two branch-&-cut approaches that avoid the complete enumeration of the constraints resulting in more efficient procedures. We report the results of an extensive battery of computational experiments comparing the performance of the different approaches.

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Mixed integer programming (90C11) Continuous location (90B85)

This page was built for publication: Continuous maximal covering location problems with interconnected facilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6340221)