Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.28084

An Exact Algorithm for the Max-Min Covering Location Blocker Problem

Yun-Tian Zhang·Chen Chen·Fabio Furini·Ivana Ljubić
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce the Max-Min Covering Location Blocker Problem, a bilevel optimization problem in which a leader blocks a minimum-cost set of candidate locations so that the optimal coverage of a budget-constrained follower does not exceed a prescribed target. Each customer's coverage is determined by the least favorable open facility that can serve it. The induced follower coverage set function is nonmonotone and nonsubmodular, so the validity of interdiction cuts cannot be inherited from existing frameworks. We develop an exact nested decomposition that exploits the max-min coverage structure at both levels. At the outer level, we establish the validity of interdiction cuts from this structure and strengthen them with facility-specific coefficients bounding the coverage lost when a critical facility is removed. We solve the NP-hard follower problem by branch-and-Benders-cut after projecting out the customer coverage variables, and characterize an optimal dual solution of the separation problem in closed form, generating Benders optimality cuts in linear time without solving a linear program. Computational experiments on benchmark instances show that both ingredients substantially improve the performance of the method. With a moderate number of candidate locations, instances with 300,000 customers are solved to optimality within one hour. A comparison with two general-purpose bilevel solvers from the literature shows the proposed method to be one to three orders of magnitude faster, and to solve to optimality instances that neither of them closes. The model applies wherever the planner cannot control which facility serves a customer, as in public automated external defibrillator (AED) networks. A case study on a network using real AED data from Virginia Beach illustrates the model.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yun-Tian Zhang, Chen Chen, Fabio Furini, Ivana Ljubić. 2026-09-23. An Exact Algorithm for the Max-Min Covering Location Blocker Problem. https://arxiv.org/abs/2609.28084

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the stability of proximal operators in Wasserstein spaces under different notions of convexity

The proximal operator is a fundamental tool in variational analysis and optimization. In the setting of a Hilbert space, given a proper, lower semicontinuous convex functional, its proximal operator is non-expansive, that is, 1-Lipschitz continuous. In the Wasserstein setting, the contraction properties of this operator have been investigated from different perspectives by Carlen and Craig and by Adve and Mészáros, among others, and are not completely understood. In this paper, we study the stability properties of proximal maps, with a particular focus on non-expansivity, under various notions of convexity of the functional that can be considered in the Wasserstein space.

math.OC↗
arXiv2026

Symmetry-dependence in Rounding of a Convex Body

The symmetry measure of a convex body $S\subset\mathbb{R}^n$ is given by: $\mathrm{sym}(S):=\max\{α\ge0:\text{ there exists }x\in S\text{ such that }-α(S-x)\subseteq S-x\}$, where such an $x$ is called a Minkowski center. We prove that every convex body $S$ admits a $\sqrt{\frac{n}{\mathrm{sym}(S)}}$-rounding of $S$, namely, there exists an origin-centered ellipsoid $E$ and a center $c$ such that $E\subseteq S-c\subseteq\sqrt{\frac{n}{\mathrm{sym}(S)}}\,E$. This result was conjectured in 2005 by Belloni and Freund. As special cases, this recovers an $n$-rounding of $S$ (since $\mathrm{sym}(S)\ge\frac{1}{n}$), and a $\sqrt{n}$-rounding when $\mathrm{sym}(S)=1$. In the case when $S$ is a polytope given as the convex hull of points, the desired rounding is produced by a regularized minimum-volume covering ellipsoid problem where the regularization is with respect to the Minkowski center. Similarly, when $S$ is a polytope given as the intersection of halfspaces, such a rounding is produced by a regularized maximum-volume inscribed ellipsoid problem. In both of these cases, the rounding can be computed by first solving a linear optimization problem (to compute $\mathrm{sym}(S)$ and a Minkowski center), and then solving a convex optimization problem with a logarithmic determinant objective, second-order cone constraints, and one semidefinite cone constraint. We also show that the factor $\sqrt{\frac{n}{\mathrm{sym}(S)}}$ is nearly tight in its dependence on dimension and symmetry. When $\frac{n+1}{1+\mathrm{sym}(S)}$ is an integer, we show by explicit construction that the factor $\sqrt{\frac{n}{\mathrm{sym}(S)}}$ is tight. In the more general case, for every dimension $n$ and every admissible symmetry value, we construct a polytope $S$ for which every rounding factor is at least $\sqrt{\frac{2}{3}}\sqrt{\frac{n}{\mathrm{sym}(S)}}$.

math.OC↗
arXiv2026

Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities

We analyze a stochastic algorithm with Halpern-type anchoring for constrained convex-concave problems and monotone variational inequalities. This single-loop and single-call algorithm uses one unbiased sample of the gradient operator at every iteration, to be applicable to monotone games with noisy feedback. With $t$ denoting the iteration counter, we prove an anytime last-iterate convergence rate of $O(t^{-1/4})$ for both the gradient-mapping norm and restricted gap, bypassing the $O(t^{-1/5})$ constrained-anytime bottleneck in the literature. Specializing then to multi-point oracles, we use variance reduction to achieve the $O(t^{-1/2})$ rate with an anytime single-loop algorithm using $2$ samples per iteration. Our results allow constrained problems with a potentially unbounded feasible set; as well as a structured class of stochastic oracles whose variance need not be uniformly bounded.

math.OC↗