The complete vertex p-center problem
The vertex p-center problem consists of locating p facilities among a set of M potential sites such that the maximum distance from any demand to its closest located facility is minimized. The complete vertex p-center problem solves the p-center problem for all p from 1 to the total number of sites,...
Saved in:
| Main Author: | |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Elsevier
2020
|
| Subjects: | |
| Online Access: | https://doaj.org/article/d4d62cbe3b094d379bcac9cb3e7f77d5 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|