References

Ahuja, R.K., K. Mehlhorn, J. Orlin and R.E. Tarjan, 1990. Faster algorithms for the shortest path problem. J. ACM., 37: 213-223.
CrossRef  |  Direct Link  |  

BL, F., 1975. K-th shortest paths and applications to the probabilistic networks. ORSA/TIMS. Joint National Meeting, 23: 263-263.

Baglin, G., 2005. Industrial and Logistics Management: Designing and Managing the Supply Chain. 5th Edn., Edition Economica, Paris, ISBN:9782717853421, Pages: 746 (In French).

Bako, A. and P. Kas, 1977. Determining the K-th shortest path by matrix method. Szigma, 10: 61-66.

Borgwardt, K.M. and H.P. Kriegel, 2005. Shortest-path kernels on graphs. Proceedings of the 5th IEEE International Conference on Data Mining, November 27-30, 2005, Houston, TX., USA., pp: 74-81.

Brander, A.W. and M.C. Sinclair, 1996. A Comparative Study of K-Shortest Path Algorithms. In: Performance Engineering of Computer and Telecommunications Systems, Merabti, M., M. Carew and F. Ball (Eds.). Springer, London, UK., ISBN:978-3-540-76008-5, pp: 370-379.

Cavellin, J., M.C. Debourg and O. Perrier, 2005. Marketing Practice. 2nd Edn., BERTI Editions, Dely Ibrahim, Algeria, Pages: 372.

Clarkson, K., 1987. Approximation algorithms for shortest path motion planning. Proceedings of the 19th annual ACM Symposium on Theory of Computing (STOC'87), May 25-27, 1987, ACM, New York, USA., ISBN:0-89791-221-7, pp: 56-65.

Katoh, N., T. Ibaraki and H. Mine, 1982. An efficient algorithm for K shortest simple paths. Networks, 12: 411-427.
CrossRef  |  Direct Link  |  

Kumar, N. and R.K. Ghosh, 1994. Parallel algorithm for finding first K shortest paths. Comput. Sci. Inf., 24: 21-28.

Mentzer, J.T., W. DeWitt, J.S. Keebler, S. Min, N.W. Nix, C.D. Smith and Z.G. Zacharia, 2001. Defining supply chain management. J. Bus. Logist., 22: 1-25.
CrossRef  |  Direct Link  |  

Wiame, E.H.E.C., 2017. The organizational modeling of a supply chain management. Intl. J. Innovations Eng. Technol., 8: 76-81.