Lagrangean duals and exact solution to the capacitated p-center problem
In this work, we address the capacitated p-center problem (CpCP). We study two auxiliary problems, discuss their relation to CpCP, and analyze the lower bounds obtained with two different Lagrangean duals based on each of these auxiliary problems. We also compare two different strategies for solving exactly CpCP, based on binary search and sequential search, respectively. Various data sets from the literature have been used for evaluating the performance of the proposed algorithms.
Year of publication: |
2010
|
---|---|
Authors: | Albareda-Sambola, Maria ; Díaz, Juan A. ; Fernández, Elena |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 201.2010, 1, p. 71-81
|
Publisher: |
Elsevier |
Keywords: | Discrete location Capacitated p-center Lagrangean relaxation |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Lagrangean duals and exact solution to the capacitated p-center problem
Albareda-Sambola, Maria, (2010)
-
Albareda-Sambola, Maria, (2010)
-
Lagrangean relaxation for the capacitated hub location problem with single assignment
Contreras, Ivan, (2009)
- More ...