메뉴 건너뛰기




Volumn 170, Issue 3, 2006, Pages 900-908

A new relaxation method for the generalized minimum spanning tree problem

Author keywords

Combinatorial optimization; Generalized minimum spanning tree problem; Minimum spanning trees

Indexed keywords

COMBINATORIAL MATHEMATICS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

EID: 27744480327     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.07.058     Document Type: Article
Times cited : (32)

References (11)
  • 4
    • 0141651910 scopus 로고    scopus 로고
    • A comparative analysis of several formulations for the generalized minimum spanning tree problem
    • C. Feremans, M. Labbé, and G. Laporte A comparative analysis of several formulations for the generalized minimum spanning tree problem Networks 39 1 2002 29 34
    • (2002) Networks , vol.39 , Issue.1 , pp. 29-34
    • Feremans, C.1    Labbé, M.2    Laporte, G.3
  • 5
    • 0031144089 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for the symmetric generalized traveling salesman problem
    • M. Fischetti, J.J. Salazar, and P. Toth A branch-and-cut algorithm for the symmetric generalized traveling salesman problem Operations Research 45 1997 378 394
    • (1997) Operations Research , vol.45 , pp. 378-394
    • Fischetti, M.1    Salazar, J.J.2    Toth, P.3
  • 8
    • 21844481977 scopus 로고
    • On the generalized minimum spanning tree problem
    • Y.S. Myung, C.H. Lee, and D.W. Tcha On the generalized minimum spanning tree problem Networks 26 1995 513 623
    • (1995) Networks , vol.26 , pp. 513-623
    • Myung, Y.S.1    Lee, C.H.2    Tcha, D.W.3
  • 10
  • 11
    • 0026390010 scopus 로고
    • Expressing combinatorial optimization problems by linear programs
    • M. Yannakakis Expressing combinatorial optimization problems by linear programs Journal of Computer and System Sciences 43 1991 441 466
    • (1991) Journal of Computer and System Sciences , vol.43 , pp. 441-466
    • Yannakakis, M.1


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