The hierarchical network design problem with multiple primary paths

European Journal of Operational Research

Volumn 96, Issue 2, 1997, Pages 323-328

  Sancho, N G F ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Dynamic programming; Networks; Routing; Shortest spanning tree

Indexed keywords

DESIGN; DYNAMIC PROGRAMMING; NETWORK PROTOCOLS; OPTIMIZATION; PIPELINES; SET THEORY; TRANSPORTATION ROUTES;

HIERARCHICAL NETWORK DESIGN PROBLEM; MULTIPLE PRIMARY PATHS;

HIERARCHICAL SYSTEMS;

EID: 0030838135     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00333-9     Document Type: Article

References (4)

1. Current, J.R., ReVelle, C.S., and Cohon, J.L. (1986) "The hierarchical network design problem", European Journal of Operational Research 27, 57-66.
2. Lawler, E. (1991) Combinatorial Optimization: Networks and Matroids, Holt, Rinehart & Winston, New York, 1976.
3. Pirkul, H., Current, J., and Nagarajan, V. (1991), "The Hierarchical Network Design Problem: A new formulation and solution procedure", Transportation Science 25, 175-182.
4. Sancho, N. (1995), "A suboptimal solution to a hierarchical network design problem using dynamic programming", European Journal of Operational Research 83, 237-244.