Muestra métricas de impacto externas asociadas a la publicación. Para mayor detalle:
| Indexado |
|
||||
| DOI | 10.1016/J.COR.2011.05.015 | ||||
| Año | 2012 | ||||
| Tipo | artículo de investigación |
Citas Totales
Autores Afiliación Chile
Instituciones Chile
% Participación
Internacional
Autores
Afiliación Extranjera
Instituciones
Extranjeras
We address the p-cable-trench problem. In this problem, p facilities are located, a trench network is dug and cables are laid in the trenches, so that every customer - or demand - in the region is connected to a facility through a cable. The digging cost of the trenches, as well as the sum of the cable lengths between the customers and their assigned facilities, are minimized. We formulate an integer programming model of the problem using multicommodity flows that allows finding the solution for instances of up to 200 nodes. We also propose two Lagrangean Relaxation-based heuristics to solve larger instances of the problem. Computational experience is provided for instances of up to 300 nodes. (C) 2011 Elsevier Ltd. All rights reserved.
| Ord. | Autor | Género | Institución - País |
|---|---|---|---|
| 1 | MARIANOV-KLUGE, VLADIMIR | Hombre |
Pontificia Universidad Católica de Chile - Chile
|
| 2 | Gutierrez-Jarpa, Gabriel | Hombre |
Pontificia Universidad Católica de Valparaíso - Chile
|
| 3 | OBREQUE-NINEZ, CARLOS | Hombre |
Universidad del Bío Bío - Chile
|
| 4 | CORNEJO-ZUNIGA, OSCAR | Hombre |
Universidad Católica de la Santísima Concepción - Chile
|
| Fuente |
|---|
| FONDECYT |
| Fondo Nacional de Desarrollo Científico y Tecnológico |
| Comisión Nacional de Investigación Científica y Tecnológica |
| Universidad Católica de la Santísima Concepción |
| Comisión Nacional de Investigación CientÃfica y Tecnológica |
| Fondo Nacional de Desarrollo CientÃfico, Tecnológico y de Innovación Tecnológica |
| Universidad Católica de la SantÃsima Concepción |
| Direccion de Investigacion de la Universidad Catolica de la Santisima Concepcion |
| Instituto Milenio Complex Engineering Systems |
| Agradecimiento |
|---|
| We thank two anonymous referees for providing many insightful comments, as well as for suggesting a source for the Sobolev problem instances. We gratefully acknowledge the funding of this research by Direccion de Investigacion de la Universidad Catolica de la Santisima Concepcion under Project DIN12-2008; Instituto Milenio Complex Engineering Systems, under grants ICM P-05-004-F and CONICYT FBO16, and FONDECYT 1100296. |
| We thank two anonymous referees for providing many insightful comments, as well as for suggesting a source for the Sobolev problem instances. We gratefully acknowledge the funding of this research by Dirección de Investigación de la Universidad Católica de la Santísima Concepción under Project DIN12-2008 ; Instituto Milenio Complex Engineering Systems , under grants ICM P-05-004-F and CONICYT FBO16 , and FONDECYT 1100296 . |