Abstract
In this chapter, we present an algorithm for multi-stage optimization of paths in a directed graph relative to different cost functions. We consider two types of cost functions: for a given path, a function of the first type is equal to the sum of weights of edges in the path, and a function of the second type is equal to the minimum weight of some edge in the path. Weights of edges for different cost functions can be different. We study the problem of minimization for functions of the first type, and the problem of maximization for functions of the second type.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
AbuBekr, J., Chikalov, I., Hussain, S., Moshkov, M.: Sequential optimization of paths in directed graphs relative to different cost functions. In: Sato, M., Matsuoka, S., Sloot, P.M.A., van Albada, G.D., Dongarra, J. (eds.) International Conference on Computational Science, ICCS 2011, Nanyang Technological University, Singapore, June 1–3, 2011, Procedia Computer Science, vol. 4, pp. 1272–1277. Elsevier (2011)
Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87–90 (1958)
Cherkassky, B., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: Theory and experimental evaluation. Math. Programm. 73, 129–174 (1993)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)
Ford, L.R.: Network flow theory. Technical Report P-923, RAND, Santa Monica, CA (1956)
Warshall, S.: A theorem on boolean matrices. J. ACM 9(1), 11–12 (1962)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M. (2019). Optimal Paths in Directed Graphs. In: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. Intelligent Systems Reference Library, vol 146. Springer, Cham. https://doi.org/10.1007/978-3-319-91839-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-91839-6_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91838-9
Online ISBN: 978-3-319-91839-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)