The hierarchical network design problem

European Journal of Operational Research

Volumn 27, Issue 1, 1986, Pages 57-66

  Current, John R ^a   ReVelle, Charles S ^b   Cohon, Jared L ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

General transportation; heuristics; integer programming; networks

Indexed keywords

EID: 0007992512     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(86)80007-8     Document Type: Article

References (23)

1. Solving large-scaled symmetric travelling salesman problems to optimality
2. Multiobjective design of transportation networks
3. The shortest covering path problem: An application of locational constraints to network design
4. The application of location models to the multiobjective design of transportation networks
5. The maximum covering/shortest path problem: A multiobjective network design and routing formulation
6. Solution of a large-scale traveling-salesman problem
7. Shortest-path algorithms: Taxonomy and annotation
8. Multicriteria optimization methods in transport project evaluation: The case of rural roads in developing countries
9. Deterministic network optimization A bibliography
10. Current and future research directions in network optimization
11. An efficient algorithm for K shortest simple paths
12. Heuristic programming as an aid to network design
13. Network design and transportation planning: Models and algorithms
14. On the symmetric travelling salesman problem A computational study
15. Iterative methods for determining the K shortest paths on a network
16. On algorithms for finding the K shortest paths in a network
17. Heuristics