Lagrangean Duals and Exact Solution to the Capacitated p-Center Problem

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/412

dc.contributor	Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa
dc.contributor	Universitat Politècnica de Catalunya. PROMALS - Grup de Recerca en Programació Matemática, Logística i Simulació
dc.contributor.author	Albareda Sambola, Maria
dc.contributor.author	Díaz, Juan A.
dc.contributor.author	Fernández Aréizaga, Elena
dc.date	2006-06-12
dc.identifier.uri	http://hdl.handle.net/2117/412
dc.language.iso	eng
dc.relation	SADERYL2: 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)
dc.rights	Attribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject	Lagrange problem
dc.subject	Operations research
dc.subject	Discrete Location
dc.subject	Lagrangean Relaxation
dc.subject	Lagrange, Dimànica de
dc.subject	Investigació operativa
dc.subject	Classificació AMS::90 Operations research, mathematical programming
dc.title	Lagrangean Duals and Exact Solution to the Capacitated p-Center Problem
dc.type	info:eu-repo/semantics/article
dc.description.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.

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author