Lagrangean Duals and Exact Solution to the Capacitated p-Center Problem
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/412
Tipus de documentArticle
Data publicació2006-06-12
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 2.5 Espanya
Abstract
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an
exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we propose two different Lagrangean duals based on each of the auxiliary problems. The lower and upper bounds provided by each of the Lagrangean duals reduce notably the set of candidate radii and allow to solve the problem with an exact algorithm based on binary search. The results obtained with experimental testing on various data sets from literature
show the efficiency of the proposal that outperforms previous proposals.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
AlbaredaDiazFernandez.pdf | 216,2Kb | Visualitza/Obre |