To access the full text documents, please follow this link:

Lagrangean Duals and Exact Solution to the Capacitated p-Center Problem
Albareda Sambola, Maria; Díaz, Juan A.; Fernández Aréizaga, Elena
Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa; Universitat Politècnica de Catalunya. Grup de Recerca en Programació Matemática, Logística i Simulació
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.
Àrees temàtiques de la UPC::Matemàtiques i estadística
Lagrange problem
Operations research
Discrete Location
Lagrangean Relaxation
Lagrange, Dimànica de
Investigació operativa
Classificació AMS::90 Operations research, mathematical programming
Attribution-NonCommercial-NoDerivs 2.5 Spain

Show full item record

Related documents

Other documents of the same author

Albareda Sambola, Maria; Fernández Aréizaga, Elena; Nickel, Stefan
Albareda Sambola, Maria; Alonso Ayuso, Antonio; Escudero Bueno, Laureano; Fernández Aréizaga, Elena; Pizarro Romero, Celeste
Ruiz Ruiz, Hector Efrain; Albareda Sambola, Maria; Fernández Aréizaga, Elena; Resende, Mauricio G. C.
Albareda Sambola, Maria; Fernández Aréizaga, Elena; Hinojosa, Yolanda; Puerto Albandoz, Justo
Albareda Sambola, Maria; Hinojosa, Yolanda; Marín, Alfredo; Puerto Albandoz, Justo