Model Perspective
Dec 10, 2022 · Operations
How Many Guards Are Needed to Cover Every Aisle in a Grid‑Shaped Supermarket?
This article models the problem of placing the fewest guards in an m‑by‑n grid of supermarket aisles, derives two lower‑bound propositions, constructs guard arrangements for several cases, and shows that the minimum number of guards equals the ceiling of (m + n) divided by two.
combinatorial optimizationgridguard placement
0 likes · 6 min read