메뉴 건너뛰기
Naval Research Logistics
Volumn 46, Issue 5, 1999, Pages 487-506
The Network Redesign Problem for Access Telecommunications Networks
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0345918756     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199908)46:5<487::AID-NAV3>3.0.CO;2-B     Document Type: Article
Times cited : (11)
References (17)
  • 1
    • 34249928131 scopus 로고
    • Models for planning capacity expansion in local access telecommunication networks
    • A. Balakrishnan, T.L. Magnanti, A. Shulman, and R.T. Wong, Models for planning capacity expansion in local access telecommunication networks, Ann Oper Res 33 (1991), 239-284.
    • (1991) Ann Oper Res , vol.33 , pp. 239-284
    • Balakrishnan, A.1    Magnanti, T.L.2    Shulman, A.3    Wong, R.T.4
  • 2
    • 0002904552 scopus 로고
    • A decomposition algorithm for local access telecommunications network expansion planning
    • A. Balakrishnan, T.L. Magnanti, and R.T. Wong, A decomposition algorithm for local access telecommunications network expansion planning, Oper Res 43 (1995), 58-76.
    • (1995) Oper Res , vol.43 , pp. 58-76
    • Balakrishnan, A.1    Magnanti, T.L.2    Wong, R.T.3
  • 3
    • 84989741907 scopus 로고
    • A heuris ic method for facility planning in telecommunications networks with multiple alternate routes
    • I. Baybars and R.H. Edahl, A heuris ic method for facility planning in telecommunications networks with multiple alternate routes, Nav Res Logistics 35 (1988), 503-528.
    • (1988) Nav Res Logistics , vol.35 , pp. 503-528
    • Baybars, I.1    Edahl, R.H.2
  • 5
    • 0016477043 scopus 로고
    • Heuristic methods for solving large scale network routing problems: The Telpaking problem
    • A. Claus and D.J. Kleitman, Heuristic methods for solving large scale network routing problems: The Telpaking problem, Stud Appl Matl 54 (1975), 17-29.
    • (1975) Stud Appl Matl , vol.54 , pp. 17-29
    • Claus, A.1    Kleitman, D.J.2
  • 6
    • 21144463851 scopus 로고
    • Optimal expansion of fiber-optic telecommunications networks in metropolitan areas
    • L.A. Cox, W.E Kuehner, S.H. Parrish, and Y. Qiu, Optimal expansion of fiber-optic telecommunications networks in metropolitan areas, Interfaces 23 (1993), 35-48.
    • (1993) Interfaces , vol.23 , pp. 35-48
    • Cox, L.A.1    Kuehner, W.E.2    Parrish, S.H.3    Qiu, Y.4
  • 7
    • 0002033653 scopus 로고
    • Topological design of telecommunication networks - Local access design methods
    • B. Gavish, Topological design of telecommunication networks - local access design methods. Ann Oper Res 33 (1991), 17-71.
    • (1991) Ann Oper Res , vol.33 , pp. 17-71
    • Gavish, B.1
  • 8
    • 0001016689 scopus 로고
    • Backbone network design tools with economic tradeoffs
    • B. Gavish and K. Altinkemer, Backbone network design tools with economic tradeoffs, ORSA J Comput 2 (1990), 236-252.
    • (1990) ORSA J Comput , vol.2 , pp. 236-252
    • Gavish, B.1    Altinkemer, K.2
  • 9
    • 0012280504 scopus 로고
    • Design and implementation of an interactive optimization system for telephone network planning
    • C. Jack, S.-R. Kai, and A. Shulman, Design and implementation of an interactive optimization system for telephone network planning, Oper Res 40 (1992), 14-25.
    • (1992) Oper Res , vol.40 , pp. 14-25
    • Jack, C.1    Kai, S.-R.2    Shulman, A.3
  • 10
    • 0025455903 scopus 로고
    • A capacity improvement lower bound for fixed charge network design problems
    • B.W. Lamar, Y. Sheffi, and W.B. Powell, A capacity improvement lower bound for fixed charge network design problems, Oper Res 38 (1990), 704-710.
    • (1990) Oper Res , vol.38 , pp. 704-710
    • Lamar, B.W.1    Sheffi, Y.2    Powell, W.B.3
  • 11
    • 0023313342 scopus 로고
    • Multifacility-type capacity expansion planning: Algorithms and complexities
    • S.-B. Lee, and H. Luss, Multifacility-type capacity expansion planning: Algorithms and complexities. Oper Res 35 (1987), 249-253.
    • (1987) Oper Res , vol.35 , pp. 249-253
    • Lee, S.-B.1    Luss, H.2
  • 12
    • 0020183161 scopus 로고
    • Operations research and capacity expansion problems: A survey
    • H. Luss, Operations research and capacity expansion problems: A survey, Oper Res 30 (1982). 907-947.
    • (1982) Oper Res , vol.30 , pp. 907-947
    • Luss, H.1
  • 13
    • 0021376457 scopus 로고
    • Network design and transportation planning: Models and algorithms
    • T.L. Magnanti, and R.T. Wong, Network design and transportation planning: Models and algorithms, Transport Sci 18(1984), 1-55.
    • (1984) Transport Sci , vol.18 , pp. 1-55
    • Magnanti, T.L.1    Wong, R.T.2
  • 14
    • 0001258594 scopus 로고
    • Modeling and solving the two-facility capacitated network loading problem
    • T.L. Magnanti, P. Mirchandani, and R. Vachani, Modeling and solving the two-facility capacitated network loading problem, Oper Res 43 (1995), 142-157.
    • (1995) Oper Res , vol.43 , pp. 142-157
    • Magnanti, T.L.1    Mirchandani, P.2    Vachani, R.3
  • 15
    • 84987049992 scopus 로고
    • Network synthesis and optimum network design problems: Models, solution methods and applications
    • M. Minoux, Network synthesis and optimum network design problems: Models, solution methods and applications, Networks 19 (1989), 313-360.
    • (1989) Networks , vol.19 , pp. 313-360
    • Minoux, M.1
  • 16
    • 0007469905 scopus 로고
    • The one-terminal TELPAK Problem
    • B. Rothfarb and M. Goldstein, The one-terminal TELPAK Problem, Oper Res 19 (1971), 156-169.
    • (1971) Oper Res , vol.19 , pp. 156-169
    • Rothfarb, B.1    Goldstein, M.2
  • 17
    • 84981622582 scopus 로고
    • Minimum cost routing for static network models
    • B. Yaged, Minimum cost routing for static network models, Networks 1 (1971), 139-172.
    • (1971) Networks , vol.1 , pp. 139-172
    • Yaged, B.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.