메뉴 건너뛰기




Volumn 106, Issue 1-4, 2001, Pages 47-61

An Augmented Arborescence Formulation for the Two-Level Network Design Problem

Author keywords

Linear programming relaxations; Multicommodity flow models; Network design; Spanning trees and steiner trees

Indexed keywords


EID: 0035567111     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1014553523631     Document Type: Article
Times cited : (9)

References (12)
  • 2
    • 0028467376 scopus 로고
    • Modeling and heuristic worst-case performance analysis of the two-level network design problem
    • A. Balakrishnan, T. Magnanti and P. Mirchandani, 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
    • 0028423826 scopus 로고
    • Dual-based algorithm for multi-level network design
    • A. Balakrishnan, T. Magnanti and P. Mirchandani, 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
  • 6
    • 0005422920 scopus 로고
    • An efficient algorithm for the min-sum arborescence problem on complete digraphs
    • M. Fischetti, and P. Toth, An efficient algorithm for the min-sum arborescence problem on complete digraphs, ORSA Journal on Computing 5(4) (1993) 426-434.
    • (1993) ORSA Journal on Computing , vol.5 , Issue.4 , pp. 426-434
    • Fischetti, M.1    Toth, P.2
  • 7
    • 21144461865 scopus 로고
    • A catalog of Steiner tree formulations
    • M. Goemans and Y. Myung, A catalog of Steiner tree formulations, Networks 23 (1993) 19-28.
    • (1993) Networks , vol.23 , pp. 19-28
    • Goemans, M.1    Myung, Y.2
  • 9
    • 84863090748 scopus 로고
    • Steiner tree problems
    • F.W. Hwang and D.S. Richards, Steiner tree problems, Networks 22 (1992) 55-90.
    • (1992) Networks , vol.22 , pp. 55-90
    • Hwang, F.W.1    Richards, D.S.2
  • 10
    • 0039419369 scopus 로고
    • Equivalent formulations for the Steiner problem in graphs
    • eds. D.-Z. Du and P.M. Pardalos
    • B.N. Khoury, P.M. Pardalos and D.W. Hearn, Equivalent formulations for the Steiner problem in graphs, in: Network Optimization Problems, eds. D.-Z. Du and P.M. Pardalos (1993) pp. 111-123.
    • (1993) Network Optimization Problems , pp. 111-123
    • Khoury, B.N.1    Pardalos, P.M.2    Hearn, D.W.3
  • 11
    • 77957043865 scopus 로고
    • Optimal trees
    • eds. M.O. Ball et al.
    • T.L. Magnanti and L.A. Wolsey, Optimal trees, in: Handbooks in OR & MS, Vol. 7, eds. M.O. Ball et al. (1995) pp. 503-615.
    • (1995) Handbooks in or & MS , vol.7 , pp. 503-615
    • Magnanti, T.L.1    Wolsey, L.A.2


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