메뉴 건너뛰기
Networks
Volumn 44, Issue 4, 2004, Pages 254-265
A 2-path approach for odd-diameter-constrained minimum spanning and steiner trees
Author keywords

Diameter constrained trees; Hop indexed models; Network flows
Indexed keywords

DIAMETER COPNSTRAINED TREES; HOP-INDEXED MODELS; NETWORK FLOWS; STEINER TREES;
EID: 9744253800     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20034     Document Type: Review
Times cited : (27)
References (9)
  • 1
    • 2142789901 scopus 로고    scopus 로고
    • Parallel heuristics for the diameter-constrained minimum spanning tree
    • A. Abdalla, N. Deo, and R. Fraceschini, Parallel heuristics for the diameter-constrained minimum spanning tree, Congress Num 136 (1999), 97-118.
    • (1999) Congress Num , vol.136 , pp. 97-118
    • Abdalla, A.1    Deo, N.2    Fraceschini, R.3
  • 2
    • 2142784823 scopus 로고
    • Algorithms for the minimum weight spanning tree with bounded diameter problem
    • P.K.H. Phua, C.M. Wang, W.Y. Yeong, T.Y. Leong, H.T. Loh, K.C. Tan, and F.S. Chou (Editors), World Scientific Publishing
    • N.R. Achuthan, L. Caccetta, P. Caccetta, and J.F. Geelen, "Algorithms for the minimum weight spanning tree with bounded diameter problem," Optimization: Techniques and applications 1, P.K.H. Phua, C.M. Wang, W.Y. Yeong, T.Y. Leong, H.T. Loh, K.C. Tan, and F.S. Chou (Editors), World Scientific Publishing, 1992, pp. 297-304.
    • (1992) Optimization: Techniques and Applications , vol.1 , pp. 297-304
    • Achuthan, N.R.1    Caccetta, L.2    Caccetta, P.3    Geelen, J.F.4
  • 3
    • 2142679971 scopus 로고
    • Computational methods for the diameter restricted minimum weight spanning tree problem
    • N.R. Achuthan, L. Caccetta, P. Caccetta, and J.F. Geelen, Computational methods for the diameter restricted minimum weight spanning tree problem, Australasian J Combin 10 (1994), 51-71.
    • (1994) Australasian J Combin , vol.10 , pp. 51-71
    • Achuthan, N.R.1    Caccetta, L.2    Caccetta, P.3    Geelen, J.F.4
  • 6
    • 0001276437 scopus 로고    scopus 로고
    • Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints
    • L. Gouveia, Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints, INFORMS J Comput 10 (1998), 180-188.
    • (1998) INFORMS J Comput , vol.10 , pp. 180-188
    • Gouveia, L.1
  • 7
    • 2142795873 scopus 로고    scopus 로고
    • Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
    • L. Gouveia and T. Magnanti, Network flow models for designing diameter-constrained minimum-spanning and Steiner trees, Networks 41 (2003), 159-173.
    • (2003) Networks , vol.41 , pp. 159-173
    • Gouveia, L.1    Magnanti, T.2
  • 8
    • 0021376457 scopus 로고
    • Network design and transportation planning: Models and algorithms
    • T. Magnanti and R. Wong, Network design and transportation planning: models and algorithms, Trans Sci 18 (1984), 1-55.
    • (1984) Trans Sci , vol.18 , pp. 1-55
    • Magnanti, T.1    Wong, R.2
  • 9
    • 0023849058 scopus 로고
    • The design of centralized networks with reliability and availability constraints
    • K. Woolston and S. Albin, The design of centralized networks with reliability and availability constraints, Comput Oper Res 15 (1988), 207-217.
    • (1988) Comput Oper Res , vol.15 , pp. 207-217
    • Woolston, K.1    Albin, S.2

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