Show simple item record

dc.contributor.authorAlbareda Sambola, Maria
dc.contributor.authorDíaz, Juan A.
dc.contributor.authorFernández Aréizaga, Elena
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa
dc.description.abstractIn 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.
dc.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshLagrange problem
dc.subject.lcshOperations research
dc.subject.otherDiscrete Location
dc.subject.otherLagrangean Relaxation
dc.titleLagrangean Duals and Exact Solution to the Capacitated p-Center Problem
dc.subject.lemacLagrange, Dimànica de
dc.subject.lemacInvestigació operativa
dc.contributor.groupUniversitat Politècnica de Catalunya. PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació
dc.subject.amsClassificació AMS::90 Operations research, mathematical programming
dc.rights.accessOpen Access
dc.relation.projectidcttSADERYL2: Un sistema de ayuda a la toma de decisiones en problemas de rutas de vehículos y localización de servicios (TIC2003-05982-C05-04)

Files in this item


This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 2.5 Spain