Lagrangean relaxation heuristics for the p-cable-trench problem

[1]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[2]  L. Cooper.  Location-Allocation Problems , 1963 .

[3]  F. E. Maranzana,et al.  On the Location of Supply Points to Minimize Transport Costs , 1964 .

[4]  S. Hakimi.  Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .

[5]  Allen J. Scott.  A PROGRAMMING MODEL OF AN INTEGRATED TRANSPORTATION NETWORK , 1967 .

[6]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[7]  Roy E. Marsten,et al.  An Algorithm for Finding Almost All Of The Medians of a Network , 1972 .

[8]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[9]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.

[10]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[11]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[12]  R. Sridharan.  A Lagrangian heuristic for the capacitated plant location problem with single source constraints , 1993 .

[13]  J. Current,et al.  An efficient tabu search procedure for the p-Median Problem , 1997 .

[14]  C. Revelle,et al.  Heuristic concentration: Two stage solution construction , 1997 .

[15]  Di Yuan,et al.  A Lagrangean approach to network design problems , 1998 .

[16]  V Marianov,et al.  Survivable capacitated network design problem: new formulation and Lagrangean relaxation , 2000, J. Oper. Res. Soc..

[17]  Mark S. Daskin,et al.  AN INTEGRATED MODEL OF FACILITY LOCATION AND TRANSPORTATION NETWORK DESIGN , 2001 .

[18]  Francis J. Vasko,et al.  The cable trench problem: combining the shortest path and minimum spanning tree problems , 2002, Comput. Oper. Res..

[19]  Vladimir Marianov,et al.  Location Problems in the Public Sector , 2002 .

[20]  Hasan Pirkul,et al.  New formulations and solution procedures for the hop constrained network design problem , 2003, Eur. J. Oper. Res..

[21]  J. Reese,et al.  Solution methods for the p-median problem: An annotated bibliography , 2006 .

[22]  Pierre Hansen,et al.  The p-median problem: A survey of metaheuristic approaches , 2005, Eur. J. Oper. Res..

[23]  Jian Lu,et al.  Application of Genetic Algorithm to Network Design Problem , 2008, 2008 International Conference on Intelligent Computation Technology and Automation (ICICTA).

[24]  José Muñoz,et al.  A neural model for the p-median problem , 2008, Comput. Oper. Res..

[25]  M. Chen,et al.  A capacity scaling heuristic for the multicommodity capacitated network design problem , 2009, J. Comput. Appl. Math..

[26]  Charles ReVelle,et al.  Central Facilities Location , 2010 .