A maximal client coverage algorithm for the p-center problem
In this work, we propose a maximal client coverage algorithm for solving the p-center problem. The algorithm is created to locate p facilities and assign clients to them in order to minimize the maximum distance between clients and the facilities. We consider both uncapacitated and capacitated cases...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Chiang Mai University
2015
|
| Subjects: | |
| Online Access: | http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84872532424&origin=inward http://cmuir.cmu.ac.th/handle/6653943832/38676 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |