Lagrangean relaxation heuristics for the p-cable-trench problem
- 1 March 2012
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 39 (3) , 620-628
Abstract
No abstract availableKeywords
Funding Information
- Dirección de Investigación de la Universidad Católica de la Santísima Concepción (DIN12-2008)
- Instituto Milenio Complex Engineering Systems (ICM P-05-004-F, CONICYT FBO16, FONDECYT 1100296)
This publication has 22 references indexed in Scilit:
- A neural model for the p-median problemComputers & Operations Research, 2008
- Solution methods for the p‐median problem: An annotated bibliographyNetworks, 2006
- The cable trench problem: combining the shortest path and minimum spanning tree problemsComputers & Operations Research, 2002
- An Algorithmic Approach to Network Location Problems. II: Thep-MediansSIAM Journal on Applied Mathematics, 1979
- Central Facilities LocationGeographical Analysis, 1970
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted GraphOperations Research, 1968
- A programming model of an integrated transportation networkPapers in Regional Science, 1967
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic ProblemsOperations Research, 1965
- On the Location of Supply Points to Minimize Transport CostsJournal of the Operational Research Society, 1964
- Location-Allocation ProblemsOperations Research, 1963