Name
Abstract | ||
|---|---|---|
This paper presents the p-next center problem, which aims to locate p out of n centers so as to minimize the maximum cost of allocating customers to backup centers. In this problem it is assumed that centers can fail and customers only realize that their closest (reference) center has failed upon arrival. When this happens, they move to their backup center, i.e., to the center that is closest to the reference center. Hence, minimizing the maximum travel distance from a customer to its backup center can be seen as an alternative approach to handle humanitarian logistics, that hedges customers against severe scenario deteriorations when a center fails. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.cor.2015.01.002 | Computers & Operations Research |
Keywords | DocType | Volume |
Integer programming,Discrete location,p-center | Journal | 62 |
Issue | ISSN | Citations |
C | 0305-0548 | 2 |
PageRank | References | Authors |
0.39 | 19 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maria Albareda-Sambola | 1 | 203 | 14.01 |
| Yolanda Hinojosa | 2 | 98 | 8.14 |
| Alfredo Marín | 3 | 453 | 32.98 |
| Justo Puerto | 4 | 717 | 73.21 |