Telecommunications Access Network Design
暂无分享,去创建一个
[1] Hasan Pirkul,et al. Locating concentrators for primary and secondary coverage in a computer communications network , 1988, IEEE Trans. Commun..
[2] M. Goldstein,et al. The One-Terminal TELPAK Problem , 1971, Oper. Res..
[3] Samuel J. Raff,et al. Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..
[4] Hasan Pirkul,et al. Hierarchical concentrator location problem , 1992, Comput. Commun..
[5] Geraldo Robson Mateus,et al. Model and heuristic for a generalized access network design problem , 2000, Telecommun. Syst..
[6] David Shallcross,et al. Node Placement and Sizing for Copper Broadband Access Networks , 2001, Ann. Oper. Res..
[7] B. Gavish. Topological design of computer communication networks — The overall design problem , 1992 .
[8] Dicky C. K. Yan,et al. Designing tributary networks with multiple ring families , 1998, Comput. Oper. Res..
[9] Jeff Goldberg,et al. Technical Note - A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees , 1994, Transp. Sci..
[10] Thomas L. Magnanti,et al. Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .
[11] J. G. Klincewicz,et al. HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .
[12] Hanan Luss,et al. Operations Research and Capacity Expansion Problems: A Survey , 1982, Oper. Res..
[13] Iraj Saniee,et al. ATM Network Design: Traffic Models and Optimization-Based Heuristics , 2001, Telecommun. Syst..
[14] Brunilde Sansò,et al. A Tabu Search Algorithm for Access Network Design , 2001, Ann. Oper. Res..
[15] Walter Ciciora,et al. Modern Cable Television Technology: Video, Voice and Data Communications , 1998 .
[16] George Abe. Residential Broadband , 1999 .
[17] Hasan Pirkul,et al. Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..
[18] Mark S. Daskin,et al. Network and Discrete Location: Models, Algorithms and Applications , 1995 .
[19] Hanan Luss,et al. A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints , 1986 .
[20] Erik Rolland,et al. Hybrid Fiber Coaxial Network Design , 2002, Oper. Res..
[21] Lisa Zhang,et al. Approximation Algorithms for Access Network Design , 2002, Algorithmica.
[22] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[23] S. L. HAKIMIt. AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .
[24] Kumar N. Sivarajan,et al. Optical Networks: A Practical Perspective , 1998 .
[25] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[26] Thomas L. Magnanti,et al. A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning , 1995, Oper. Res..
[27] Choong Y. Lee. An Algorithm for the Design of Multitype Concentrator Networks , 1993 .
[28] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[29] Bezalel Gavish,et al. Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..
[30] Hasan Pirkul,et al. Hybrid fiber co-axial CATV network design with variable capacity optical network units , 2000, Eur. J. Oper. Res..
[31] Carlo Mannino,et al. Models and solution techniques for frequency assignment problems , 2003, 4OR.
[32] Linos F. Frantzeskakis,et al. The network redesign problem for access telecommunications networks , 1999 .
[33] Eric Rosenberg. Dual Ascent for Uncapacitated Telecommunications Network Design with Access, Backbone, and Switch Costs , 2001, Telecommun. Syst..
[34] Luís Gouveia,et al. Using generalized capacitated trees for designing the topology of local access networks , 1997, Telecommun. Syst..