Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.23334 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912611827712000 |
|---|---|
| author | Samanta, Sukanya Kalathoti, Abhi Rohit Gonchi, Siva Jayanth Adiraju, Venkata Krishna Kashyap Nettem, Sai Kiran |
| author_facet | Samanta, Sukanya Kalathoti, Abhi Rohit Gonchi, Siva Jayanth Adiraju, Venkata Krishna Kashyap Nettem, Sai Kiran |
| contents | The Maximal Covering Location Problem (MCLP) represents a fundamental optimization challenge in facility location theory, where the objective is to maximize demand coverage while operating under resource constraints. This paper presents a comprehensive analysis of MCLP using a set coverage methodology implemented through 0/1 knapsack dynamic programming. Our approach addresses the strategic placement of facilities to achieve optimal coverage of demand points within specified service distances. This research contributes to the understanding of facility location optimization by providing both theoretical foundations and practical algorithmic solutions for real-world applications in urban planning, emergency services, and supply chain management. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_23334 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Maximal Covering Location Problem: A Set Coverage Approach Using Dynamic Programming Samanta, Sukanya Kalathoti, Abhi Rohit Gonchi, Siva Jayanth Adiraju, Venkata Krishna Kashyap Nettem, Sai Kiran Data Structures and Algorithms The Maximal Covering Location Problem (MCLP) represents a fundamental optimization challenge in facility location theory, where the objective is to maximize demand coverage while operating under resource constraints. This paper presents a comprehensive analysis of MCLP using a set coverage methodology implemented through 0/1 knapsack dynamic programming. Our approach addresses the strategic placement of facilities to achieve optimal coverage of demand points within specified service distances. This research contributes to the understanding of facility location optimization by providing both theoretical foundations and practical algorithmic solutions for real-world applications in urban planning, emergency services, and supply chain management. |
| title | Maximal Covering Location Problem: A Set Coverage Approach Using Dynamic Programming |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2509.23334 |