Abstract
For a directed network in which vector weights are assigned to arcs, the Pareto analog to the shortest path problem is analyzed. An algorithm is presented for obtaining all Pareto shortest paths from a specified node to every other node.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Christofides, N.,Graph Theory: An Algorithm Approach, Academic Press, New York, New York, 1975.
Deo, N.,Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, Englewood Cliffs, New Jersey, 1974.
Hu, T. C.,Integer Programming and Network Flows, Addison-Wesley, Reading, Massachusetts, 1969.
Johnson, D. E., andJohnson, J. E.,Graph Theory with Engineering Applications, Ronald Press, New York, New York, 1972.
Phillips, D., andGarcia-Diaz, A.,Fundamentals of Network Analysis, Prentice-Hall, Englewood Cliffs, New Jersey, 1981.
Hitchner, L. E.,A Comparative Investigation of the Computational Efficiency of Shortest Path Algorithms, University of California, Berkeley, Operations Research Center, Report No. ORC 68-17, 1968.
Dreyfus, S. E.,An Appraisal of Some Shortest-Path Algorithms, Operations Research, Vol. 17, pp. 395–412, 1969.
Gilsinn, J., andWitzgall, C.,A Performance Comparison of Labelling Algorithms for Calculating Shortest Path Trees, National Bureau of Standards, Washington, DC, NBS Technical Note No. 777, 1973.
Golden, B.,Shortest-Path Algorithms: A Comparison, Operations Research, Vol. 24, pp. 1164–1168, 1976.
Denardo, E., andFox, B.,Shortest-Route Methods, 1: Reaching, Pruning, and Buckets, Operations Research, Vol. 27, pp. 161–186, 1979.
Bloniarz, P.,A Shortest-Path Algorithm with Expected Time 0(n 2 log n log* n), SIAM Journal on Computing, Vol. 12, pp. 588–600, 1983.
Ford, L. R.,Network Flow Theory, The Rand Corporation, Report No. P-923, 1956.
Moore, E. F.,The Shortest Path through a Maze, Proceedings of the International Symposium on the Theory of Switching, Part II, pp. 285–292, 1957; Annals of the Computation Laboratory of Harvard University, Harvard University Press, Cambridge, Massachusetts, Vol. 30, 1959.
Bellman, R. E.,On a Routing Problem, Quarterly of Applied Mathematics, Vol. 16, pp. 87–90, 1958.
Floyd, R. W.,Algorithm 97, Shortest Path, Communications of the ACM, Vol. 5, p. 345, 1962.
Dantzig, G. B.,On the Shortest Route through a Network, Management Science, Vol. 2, pp. 187–190, 1960.
Dijkstra, E. W.,A Note on Two Problems in Connection with Graphs, Numerische Mathematik, Vol. 1, pp. 269–271, 1959.
Geoffrion, A. M.,Proper Efficiency and the Theory of Vector Maximization, Journal of Mathematical Analysis and Applications, Vol. 22, pp. 618–630, 1968.
Author information
Authors and Affiliations
Additional information
Communicated by C. T. Leondes
Rights and permissions
About this article
Cite this article
Corley, H.W., Moon, I.D. Shortest paths in networks with vector weights. J Optim Theory Appl 46, 79–86 (1985). https://doi.org/10.1007/BF00938761
Issue Date:
DOI: https://doi.org/10.1007/BF00938761