메뉴 건너뛰기




Volumn 92, Issue 1, 1996, Pages 214-216

An addendum to the hierarchical network design problem

Author keywords

Elimination tests; Heuristics; Hierarchical network design problem; Network programming

Indexed keywords

DYNAMIC PROGRAMMING; HEURISTIC METHODS; HIERARCHICAL SYSTEMS; SET THEORY; TREES (MATHEMATICS);

EID: 0030570323     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(96)00016-1     Document Type: Article
Times cited : (4)

References (6)
  • 2
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • Dijkstra, E.W. (1959), "A note on two problems in connexion with graphs", Numerische Mathematik 1, 269-271.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 4
    • 0242375876 scopus 로고
    • Heuristics for the hierarchical network design problem
    • J.K. Lenstra, H. Tijms and A. Volgenant (eds.), CWI Tract 70, Centre for Mathematics and Computer Science, Amsterdam
    • Duin, C.W., 61nd Volgenant, A. (1990), "Heuristics for the hierarchical network design problem", in J.K. Lenstra, H. Tijms and A. Volgenant (eds.), Twenty-five Years of Operations Research in The Netherlands, CWI Tract 70, Centre for Mathematics and Computer Science, Amsterdam, 23-34.
    • (1990) Twenty-five Years of Operations Research in The Netherlands , pp. 23-34
    • Duin, C.W.1    Volgenant, A.2
  • 6
    • 0042407175 scopus 로고
    • A suboptimal solution to a hierarchical network design problem using dynamic programming
    • Sancho, N.G.F. (1995), "A suboptimal solution to a hierarchical network design problem using dynamic programming", European Journal of Operational Research 83, 237-244.
    • (1995) European Journal of Operational Research , vol.83 , pp. 237-244
    • Sancho, N.G.F.1


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