%0 Journal Article
%@holdercode {isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}
%@nexthigherunit 8JMKD3MGPCW/3ESGTTP
%@archivingpolicy denypublisher denyfinaldraft36
%@resumeid
%@resumeid 8JMKD3MGP5W/3C9JHMQ
%@usergroup administrator
%@usergroup jefferson
%3 A branch-and-price.pdf
%B Computers and Operations Research
%@dissemination WEBSCI; PORTALCAPES.
%X This paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is minimized. The traditional column generation process is compared with a stabilized approach that combines the column generation and Lagrangean/surrogate relaxation. The Lagrangean/surrogate multiplier modifies; the reduced cost criterion, providing the selection of new productive columns at the search tree. Computational experiments are conducted considering especially difficult instances to the traditional column generation and also with some large-scale instances. (C) 2004 Elsevier Ltd. All rights reserved.
%8 Jun.
%N 6
%T A branch-and-price approach to p-median location problems
%K p-median, column generation, Lagrangean/surrogate relaxation, branch and price /LINEAR-PROGRAMMING APPROACH, CUTTING-STOCK PROBLEM, COLUMN GENERATION, OPTIMIZATION, ALGORITHM.
%@secondarytype PRE PI
%@group LAC-INPE-MCT-BR
%@copyholder SID/SCD
%@secondarykey INPE-12556-PRE/7853
%@issn 0305-0548
%2 sid.inpe.br/marciana/2004/12.20.13.48.56
%@affiliation Sao Paulo State Univ, FEG, UNESP, Dept Math,Engn Sch, Guaratingueta, SP,
%@affiliation Instituto Nacional de Pesquisas Espaciais, Laboratorio Associado de Computação e Matematica Aplicada(INPE,LAC),
%@language English
%P 1655-1664
%4 sid.inpe.br/marciana/2004/12.20.13.48
%D 2005
%V 32
%A Senne, Edson Luis França,
%A Lorena, Luiz Antonio Nogueira,
%A Pereira, Marcos  Antonio,
%@area COMP