R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, pp.164-165, 1993.

M. Alivand, A. A. Alesheikh, and M. R. Malek, New method for finding optimal path in dynamic networks, World Applied Sci. J, vol.3, pp.25-33, 2008.

H. R. Bajgan and R. Z. Farahani, Using colony system and neighborhood search for dynamic vehicle routing problem, American Journal of Operational Research, vol.2, issue.4, pp.31-44, 2012.

D. J. Bertsimas, Probabilistic combinatorial optimization problems, 1988.

J. Erickson, Algorithms and models of computation : Minimum Spanning Trees, lecture notes, computer sciences courses, 2014.

N. Boria and V. T. Paschos, Optimization in dynamic environments, CAHIER DU LAMSADE, vol.314, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00875516

J. Colin, M. Nakechbandi, and A. S. Ould-cheikh, Route Planning in a Weakly Dynamic Undirected Graph, 1st International IEEE Conference on Advanced Logistics and Transport (ICALT'13), 2013.

C. Demetrescu and G. F. Italiano, A new approach to dynamic all pairs shortest paths, J. ACM, vol.51, issue.6, pp.968-992, 2004.

D. Fulkerson, Expected critical path lengths in PERT networks, Operations Research, vol.10, pp.808-817, 1962.

P. Jaillet, Probabilistic traveling salesman problems, 1985.

H. Mao, Pathfinding Algorithms for Mutating Graphs , Computer Systems Lab, 2007.

M. Nakechbandi, J. Colin, and A. S. Ould-cheikh, Routing and Rerouting in Territorial Systems Modeled by Weakly Dynamics Graphs, 2013.

G. Ramalingam and T. Reps, On the computational complexity of dynamic graph problems, Theoret. Comput. Sci, vol.158, pp.233-277, 1996.

P. Holme and J. , Saramäki Temporal Networks, Phys. Rep, vol.519, pp.97-125, 2012.

G. N. Frederickson, Data structures for on-line updating of minimum spanning trees, with applications, SIAM Journal of Computing, vol.14, pp.781-798, 1985.

G. N. Frederickson, Ambivalent data structures for dynamic 2-edgeconnectivity and k smallest spanning trees, SIAM Journal of Computing, vol.26, issue.2, pp.484-538, 1997.

D. Eppstein, Z. Galil, G. F. Italiano, and T. H. Spencer, Separator based sparsification. I. Planary testing and minimum spanning trees, Journal of Computer and System Sciences, vol.52, issue.1, pp.3-27, 1996.

M. R. Henzinger and V. King, Fully dynamic biconnectivity and transitive closure, Proc. 36th IEEE Symp. Foundations of Computer Science, pp.664-672, 1995.

J. Holm, K. De-lichtenberg, and M. Thorup, Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, Journal of the ACM, vol.48, issue.4, pp.723-760, 2001.

R. C. Prim, Shortest connection networks and some generalisation, Betem Tech J, vol.36, pp.1389-1401, 1957.

J. B. , On the shortest spanning sub-tree and the traveling salesman problem, proc. Amer. Soc, vol.7, pp.48-50, 1956.