Réseaux stochastiques

 Access to full text

 Full (PDF)

1. 1. M. BECKMANN, Dynamic Programming of Economic Decision, Springer-Verlag, 1968. Zbl0338.90053MR241103
2. 2. P. CHRÉTIENNE et R. FAURE, Processus stochastique, leurs graphes et usages, Gauthier-Villars, Paris. Zbl0293.60060
3. 3. G. DANTZIG, L. FORT et D. FULKERSON, A Primal Dual Algorithm for Linear Programs, Linear equalities and related systems, Princeton Univ. Press, 1956, p. 171-181. MR89774
4. 4. E. DIJSKTRA, A Note on two Problems in Connection with Graphs, Numerische Mathematik I, 1959, p.269-271. Zbl0092.16002MR107609
5. 5. R. FAURE, C. ROUCAIROL et P. TOLLA, Chemins, flots et ordonnancements, Gauthier-Villars, Paris. Zbl0349.90126
6. 6. W. FELLER, An Introduction to Probability Theory and Its Applications, Wiley International Edition. Zbl0155.23101
7. 7. R. HOWARD, Dynamic Programming and Motion Processes, M.I.T. Press, Cambridge-mass, 1960. Zbl0091.16001
8. 8. J. LAURIÈRE, Intelligence Artificielle. Eyrolles, 1987. 
9. 9. N. NILLSSON, Problem Solving Method in I.A., MacGraw-Hill, 1971. 
10. 10. C. PAPADIMITRIOU et K. STEIGLITZ, Combinatorial Optimization, Prentice Hall Ed., 1982. Zbl0503.90060MR663728
11. 11. B. ROY, Algèbre et graphes, Dunod, Paris. 
12. 12. M. SAKAROVITCH, Chemins, flots et ordonnancements dans les réseaux, Hermann, Paris, 1984. 

1. J. Maublanc, D. Peyrton, A. Quilliot, Multiple routing strategies in a labelled network
2. J. Maublanc, D. Peyrton, A. Quilliot, Multiple Routing Strategies in a Labelled Network