메뉴 건너뛰기




Volumn 36, Issue 3, 2008, Pages 366-371

Optimal design of hierarchical networks with free main path extremes

Author keywords

Heuristics; Hierarchical networks; Integer programming

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING; TREES (MATHEMATICS);

EID: 43049096786     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2007.10.007     Document Type: Article
Times cited : (7)

References (19)
  • 1
    • 0028423826 scopus 로고
    • A dual-based algorithm for multi-level network design
    • Balakrishnan A., Magnanti T., and Mirchandani P. A dual-based algorithm for multi-level network design. Management Science 40 5 (1994) 567-581
    • (1994) Management Science , vol.40 , Issue.5 , pp. 567-581
    • Balakrishnan, A.1    Magnanti, T.2    Mirchandani, P.3
  • 2
    • 0028467376 scopus 로고
    • Modeling and heuristic worst-case performance analysis of the two-level network design problem
    • Balakrishnan A., Magnanti T., and Mirchandani P. Modeling and heuristic worst-case performance analysis of the two-level network design problem. Management Science 40 7 (1994) 846-867
    • (1994) Management Science , vol.40 , Issue.7 , pp. 846-867
    • Balakrishnan, A.1    Magnanti, T.2    Mirchandani, P.3
  • 3
    • 33847762541 scopus 로고    scopus 로고
    • A branch-and-cut approach for minimum cost multi-level network design
    • Chopra S., and Tsai C. A branch-and-cut approach for minimum cost multi-level network design. Discrete Mathematics 242 (2002) 65-92
    • (2002) Discrete Mathematics , vol.242 , pp. 65-92
    • Chopra, S.1    Tsai, C.2
  • 5
    • 0024106619 scopus 로고
    • The design of a Hierarchical transportation network with transshipment facilities
    • Current J. The design of a Hierarchical transportation network with transshipment facilities. Transportation Science 22 4 (1988) 270-277
    • (1988) Transportation Science , vol.22 , Issue.4 , pp. 270-277
    • Current, J.1
  • 6
    • 0026137161 scopus 로고
    • The Hierarchical network design problem with transshipment facilities
    • Current J., and Pirkul H. The Hierarchical network design problem with transshipment facilities. European Journal of Operational Research 52 (1991) 338-347
    • (1991) European Journal of Operational Research , vol.52 , pp. 338-347
    • Current, J.1    Pirkul, H.2
  • 11
    • 0035567111 scopus 로고    scopus 로고
    • An augmented arborescence formulation for the two-level network design problem
    • Gouveia L., and Telhada J. An augmented arborescence formulation for the two-level network design problem. Annals of Operations Research 106 1-4 (2001) 47-61
    • (2001) Annals of Operations Research , vol.106 , Issue.1-4 , pp. 47-61
    • Gouveia, L.1    Telhada, J.2
  • 12
    • 0039986425 scopus 로고    scopus 로고
    • Solving Steiner tree problems in graphs to optimality
    • Koch T., and Martin A. Solving Steiner tree problems in graphs to optimality. Networks 32 (1998) 207-232
    • (1998) Networks , vol.32 , pp. 207-232
    • Koch, T.1    Martin, A.2
  • 13
    • 0008515863 scopus 로고    scopus 로고
    • Path, tree and cycle location
    • Crainic T.G., and Laporte G. (Eds), Kluwer, Boston
    • Labbé M., Laporte G., and Rodríguez I. Path, tree and cycle location. In: Crainic T.G., and Laporte G. (Eds). Fleet Management and Logistics (1998), Kluwer, Boston 187-204
    • (1998) Fleet Management and Logistics , pp. 187-204
    • Labbé, M.1    Laporte, G.2    Rodríguez, I.3
  • 16
    • 0026206532 scopus 로고
    • The Hierarchical network design problem: A new formulation and solution procedures
    • Pirkul H., Current J., and Nagarajan V. The Hierarchical network design problem: A new formulation and solution procedures. Transportation Science 25 3 (1991) 175-182
    • (1991) Transportation Science , vol.25 , Issue.3 , pp. 175-182
    • Pirkul, H.1    Current, J.2    Nagarajan, V.3
  • 17
    • 0002384288 scopus 로고
    • Locating concentrators in centralized computer networks
    • Pirkul H., and Nagarajan V. Locating concentrators in centralized computer networks. Annals of Operations Research 36 (1992) 247-262
    • (1992) Annals of Operations Research , vol.36 , pp. 247-262
    • Pirkul, H.1    Nagarajan, V.2
  • 18
    • 0042407175 scopus 로고
    • A suboptimal solution to a hierarchical network design problem using dynamic programming
    • Sancho N. A suboptimal solution to a hierarchical network design problem using dynamic programming. European Journal of Operational Research 83 (1995) 237-244
    • (1995) European Journal of Operational Research , vol.83 , pp. 237-244
    • Sancho, N.1
  • 19
    • 0030838135 scopus 로고    scopus 로고
    • The Hierarchical network design problem with multiple primary paths
    • Sancho N. The Hierarchical network design problem with multiple primary paths. European Journal of Operational Research 96 (1996) 323-328
    • (1996) European Journal of Operational Research , vol.96 , pp. 323-328
    • Sancho, N.1


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