k-Center Problems with Minimum Coverage
The k-center problem is a well-known facility location problem and can be described as follows: Given a complete undirected graph G=(V,E), a metric d:V×V→ℝ + and a positive integer k, we seek a subset U ⊆ V of at most k centers which minimizes the maximum distances from points in V to U. Formally,...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2004
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/2400 https://doi.org/10.1007/978-3-540-27798-9_38 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| id |
sg-smu-ink.lkcsb_research-3399 |
|---|---|
| record_format |
dspace |
| spelling |
sg-smu-ink.lkcsb_research-33992016-03-12T08:43:32Z k-Center Problems with Minimum Coverage LIM, Andrew RODRIGUES, Brian WANG, Fan XU, Zhou The k-center problem is a well-known facility location problem and can be described as follows: Given a complete undirected graph G=(V,E), a metric d:V×V→ℝ + and a positive integer k, we seek a subset U ⊆ V of at most k centers which minimizes the maximum distances from points in V to U. Formally, the objective function is given by: min U⊆V,|U|≤k max v∈V min r∈Ud(v,r). As a typical example, we may want to set up k service centers (e.g., police stations, fire stations, hospitals, polling centers) and minimize the maximum distances between each client and these centers. The problem is known to be NP-hard [2]. 2004-08-01T07:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/2400 info:doi/10.1007/978-3-540-27798-9_38 https://doi.org/10.1007/978-3-540-27798-9_38 Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Operations and Supply Chain Management |
| institution |
Singapore Management University |
| building |
SMU Libraries |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
SMU Libraries |
| collection |
InK@SMU |
| language |
English |
| topic |
Operations and Supply Chain Management |
| spellingShingle |
Operations and Supply Chain Management LIM, Andrew RODRIGUES, Brian WANG, Fan XU, Zhou k-Center Problems with Minimum Coverage |
| description |
The k-center problem is a well-known facility location problem and can be described as follows: Given a complete undirected graph G=(V,E), a metric d:V×V→ℝ + and a positive integer k, we seek a subset U ⊆ V of at most k centers which minimizes the maximum distances from points in V to U. Formally, the objective function is given by: min U⊆V,|U|≤k max v∈V min r∈Ud(v,r).
As a typical example, we may want to set up k service centers (e.g., police stations, fire stations, hospitals, polling centers) and minimize the maximum distances between each client and these centers. The problem is known to be NP-hard [2]. |
| format |
text |
| author |
LIM, Andrew RODRIGUES, Brian WANG, Fan XU, Zhou |
| author_facet |
LIM, Andrew RODRIGUES, Brian WANG, Fan XU, Zhou |
| author_sort |
LIM, Andrew |
| title |
k-Center Problems with Minimum Coverage |
| title_short |
k-Center Problems with Minimum Coverage |
| title_full |
k-Center Problems with Minimum Coverage |
| title_fullStr |
k-Center Problems with Minimum Coverage |
| title_full_unstemmed |
k-Center Problems with Minimum Coverage |
| title_sort |
k-center problems with minimum coverage |
| publisher |
Institutional Knowledge at Singapore Management University |
| publishDate |
2004 |
| url |
https://ink.library.smu.edu.sg/lkcsb_research/2400 https://doi.org/10.1007/978-3-540-27798-9_38 |
| _version_ |
1770570239309774848 |