The hierarchical network design problem
- 1 October 1986
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 27 (1) , 57-66
- https://doi.org/10.1016/s0377-2217(86)80007-8
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- The maximum covering/shortest path problem: A multiobjective network design and routing formulationEuropean Journal of Operational Research, 1985
- SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPERJournal of Regional Science, 1984
- Network Design and Transportation Planning: Models and AlgorithmsTransportation Science, 1984
- An efficient algorithm for K shortest simple pathsNetworks, 1982
- Current and future research directions in network optimizationComputers & Operations Research, 1981
- On the symmetric travelling salesman problem: A computational studyPublished by Springer Nature ,1980
- On algorithms for finding the k shortest paths in a networkNetworks, 1979
- Deterministic network optimization: A bibliographyNetworks, 1977
- Iterative methods for determining the k shortest paths in a networkNetworks, 1976
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954