메뉴 건너뛰기




Volumn 43, Issue 7, 1996, Pages 985-1008

Algorithms for the constrained maximum-weight connected graph problem

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; GRAPH THEORY; HEURISTIC METHODS; TREES (MATHEMATICS);

EID: 0030270966     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199610)43:7<985::AID-NAV4>3.0.CO;2-9     Document Type: Article
Times cited : (24)

References (10)
  • 2
    • 0001488483 scopus 로고
    • An Additive Algorithm for Solving Linear Programs with Zero-One Variables
    • Balas, E., "An Additive Algorithm for Solving Linear Programs with Zero-One Variables," Operations Research, 13, 517-548 (1965).
    • (1965) Operations Research , vol.13 , pp. 517-548
    • Balas, E.1
  • 3
    • 0003697643 scopus 로고
    • CPLEX Optimization, Inc., Incline Village, NV
    • CPLEX Optimization, Inc., Using the CPLEX Callable Library, CPLEX Optimization, Inc., Incline Village, NV, 1994.
    • (1994) Using the CPLEX Callable Library
  • 6
    • 0020706194 scopus 로고
    • On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
    • Johnson, D.S., and Niemi, K.A., "On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees," Mathematics of Operations Research, 8, 1-14 (1983).
    • (1983) Mathematics of Operations Research , vol.8 , pp. 1-14
    • Johnson, D.S.1    Niemi, K.A.2
  • 7
    • 4243179443 scopus 로고
    • The Maximum-Weight Connected Graph Problem
    • revised November 1995, Industrial Engineering, Southern Illinois University, Edwardsville, IL
    • Lee, H.F., and Dooly, D.R., "The Maximum-Weight Connected Graph Problem," Technical Report No. 93-4 (revised November 1995), Industrial Engineering, Southern Illinois University, Edwardsville, IL, 1993.
    • (1993) Technical Report No. 93-4
    • Lee, H.F.1    Dooly, D.R.2
  • 8
    • 4243074351 scopus 로고
    • Heuristic Algorithms for the Fiber-Optic Network Expansion Problem
    • revised February 1996, Industrial Engineering, Southern Illinois University, Edwardsville, IL
    • Lee, H.F., and Dooly, D.R., "Heuristic Algorithms for the Fiber-Optic Network Expansion Problem," Technical Report No. 94-5 (revised February 1996), Industrial Engineering, Southern Illinois University, Edwardsville, IL, 1994.
    • (1994) Technical Report No. 94-5
    • Lee, H.F.1    Dooly, D.R.2
  • 9
    • 0004160242 scopus 로고
    • Prentice-Hall, Englewood Cliffs, NJ
    • Murty, K., Network Programming, Prentice-Hall, Englewood Cliffs, NJ, 1991.
    • (1991) Network Programming
    • Murty, K.1
  • 10
    • 84987034438 scopus 로고
    • Steiner Problem in Networks: A Survey
    • Winter, P., "Steiner Problem in Networks: A Survey," Networks, 17, 129-167 (1987).
    • (1987) Networks , vol.17 , pp. 129-167
    • Winter, P.1


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