Telecommunication and location

[1]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[2]  Andranik Mirzaian,et al.  Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds , 1985, Networks.

[3]  Hasan Pirkul,et al.  Topological Design of Centralized Computer Networks , 1997 .

[4]  K S Hindi,et al.  Efficient solution of large scale, single-source, capacitated plant location problems , 1999, J. Oper. Res. Soc..

[5]  K. Jörnsten,et al.  Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem , 1991 .

[6]  J. G. Klincewicz,et al.  HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .

[7]  Dominique Peeters,et al.  Chapter 7 Location on networks , 1995 .

[8]  Thomas L. Magnanti,et al.  Valid inequalities and facets of the capacitated plant location problem , 1989, Math. Program..

[9]  S Salhi,et al.  Lagrangean heuristics applied to a variety of large capacitated plant location problems , 1998, J. Oper. Res. Soc..

[10]  J. Beasley.  Lagrangean heuristics for location problems , 1993 .

[11]  B. Gavish.  Topological design of computer communication networks — The overall design problem , 1992 .

[12]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

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

[14]  Leone C. Monticone,et al.  Application of the facility location problem to the problem of locating concentrators on an FAA microwave system , 1994, Ann. Oper. Res..

[15]  Dominique Peeters,et al.  Location on networks , 1992 .

[16]  Thomas L. Magnanti,et al.  A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning , 1995, Oper. Res..

[17]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

[18]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[19]  Di Yuan,et al.  An exact algorithm for the capacitated facility location problems with single sourcing , 1999, Eur. J. Oper. Res..

[20]  Thomas L. Magnanti,et al.  Designing satellite communication networks by zero - one quadratic programming , 1989, Networks.

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

[22]  Hasan Pirkul,et al.  Locating concentrators for primary and secondary coverage in a computer communications network , 1988, IEEE Trans. Commun..

[23]  Karen Aardal,et al.  Capacitated facility location: Separation algorithms and computational experience , 1998, Math. Program..

[24]  Laurence A. Wolsey,et al.  Capacitated Facility Location: Valid Inequalities and Facets , 1995, Math. Oper. Res..

[25]  Lalit R. Bahl,et al.  Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals , 1978, IEEE Transactions on Computers.

[26]  Mikael Rönnqvist,et al.  A repeated matching heuristic for the single-source capacitated facility location problem , 1999, Eur. J. Oper. Res..

[27]  H. Pirkul,et al.  The hierarchical network design problem with transshipment facilities , 1991 .

[28]  Hanan Luss,et al.  A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints , 1986 .

[29]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[30]  Pierre Chardaire,et al.  Upper and lower bounds for the two‐level simple plant location problem , 1999, Ann. Oper. Res..

[31]  J. Current,et al.  Theory and methodology , 1991 .

[32]  Hasan Pirkul,et al.  Locating concentrators in centralized computer networks , 1992, Ann. Oper. Res..

[33]  Byung Ha Lim,et al.  A hub location problem in designing digital data service networks: Lagrangian relaxation approach , 1996 .

[34]  Hasan Pirkul,et al.  Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..

[35]  T. B. Boffey.  Location Problems Arising in Computer Networks , 1989 .

[36]  M. R. Rao,et al.  An Algorithm for the Fixed-Charge Assigning Users to Sources Problem , 1983 .

[37]  Choong Y. Lee.  An Algorithm for the Design of Multitype Concentrator Networks , 1993 .

[38]  Ali Amiri.  Solution procedures for the service system design problem , 1997, Comput. Oper. Res..

[39]  K. Darby-Dowman,et al.  Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem , 1988 .

[40]  D. Tcha,et al.  Optimal design of a distributed network with a two-level hierarchical structure , 1992 .

[41]  J. Barceló,et al.  A heuristic lagrangean algorithm for the capacitated plant location problem , 1984 .

[42]  P. Chardaire,et al.  Solving the dynamic facility location problem , 1996 .

[43]  Alexander Shulman,et al.  An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes , 1991, Oper. Res..