arXiv (All)
open access
An Exact Algorithm for the Max-Min Covering Location Blocker Problem
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 t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improved Randomized Approximations for Strategic Obnoxious Facility Location#975312
- Narrowing Data Protection's Enforcement Gap#964839
- Patrolling by Robots Equipped with Visibility#296951
- Improved KKT Complexity for First-Order Bilevel Optimization under Weak Lower-Level Convexity#1144903
- Management of Networks with Constrained Devices: Use Cases#501971
Record · ID 1064628
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive