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: | , |
|---|---|
| 格式: | Article |
| 出版: |
Chiang Mai University
2015
|
| 主題: | |
| 在線閱讀: | http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84872532424&origin=inward http://cmuir.cmu.ac.th/handle/6653943832/38676 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Chiang Mai University |