RECHERCHE Chemin de valeur

OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

Algorithme de minimisation
 Numéroter arbitrairement de 1 à n les sommets du graphe, dont l’origine et
l’extrémité du chemin de valeur minimale cherché, seront respectivement 1 à n ;
 Désignant par v(i, j) la valeur de l’arc (xi, xj) ; v(i, j) = + si (xi, xj)  U ; v(i, j) = 0
si i = j ; A l’étape k = 1 poser Vi(1) = v(i, n) pour tout i  n et vn(1) = 0.

 A l’étape k > 1 de l’algorithme, calculer v i(k) = min [ v(i, j) + vj(k-1) ], vi(k) étant la
valeur minimale du chemin d’au plus k arcs entre x i et xn. Pour abréger les calculs, on
ne retiendra que les valeurs de j pour lesquelles vj(k-1)   et v(i, j)  .

 Arrêter d’appliquer l’algorithme dès que v i(p+1) = vi(p), ce qui se produira

nécessairement pour p  n-1.

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9
8 5 x15
1 x8 6
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3
15 8
x3 3 x14
16 12 x13
x11

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9
8 5 x15
1 x8 6
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3
15 8
x3 3 x14
16 12 x13
x11

v(i, j) = + si (xi, xj)  U ; v(i, i) = 0 ; A l’étape k = 1 Vi(1) = v(i, n)  i  n et vn(1) = 0

version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9
8 5 x15
1 x8 6
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0

v(i, j) = + si (xi, xj)  U ; v(i, i) = 0 ; A l’étape k = 1 Vi(1) = v(i, n)  i  n et vn(1) = 0

version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0

v(i, j) = + si (xi, xj)  U ; v(i, i) = 0 ; A l’étape k = 1 Vi(1) = v(i, n)  i  n et vn(1) = 0

version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0

k=1

v(i, j) = + si (xi, xj)  U ; v(i, i) = 0 ; A l’étape k = 1 Vi(1) = v(i, n)  i  n et vn(1) = 0

version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0

k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3

v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6

v(i, j) = + si (xi, xj)  U ; v(i, i) = 0 ; A l’étape k = 1 Vi(1) = v(i, n)  i  n et vn(1) = 0

version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0

k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3

v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6

v(i, j) = + si (xi, xj)  U ; v(i, i) = 0 ; A l’étape k = 1 Vi(1) = v(i, n)  i  n et vn(1) = 0

version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0

k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3

v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6

v(i, j) = + si (xi, xj)  U ; v(i, i) = 0 ; A l’étape k = 1 Vi(1) = v(i, n)  i  n et vn(1) = 0

version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0

k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3

v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6

v(i, j) = + si (xi, xj)  U ; v(i, i) = 0 ; A l’étape k = 1 Vi(1) = v(i, n)  i  n et vn(1) = 0

version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0

k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3

v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6

v(i, j) = + si (xi, xj)  U ; v(i, i) = 0 ; A l’étape k = 1 Vi(1) = v(i, n)  i  n et vn(1) = 0

version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0

k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3

v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6

v(i, j) = + si (xi, xj)  U ; v(i, i) = 0 ; A l’étape k = 1 Vi(1) = v(i, n)  i  n et vn(1) = 0

version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0

k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3

v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6
k=2

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0 vi(k) = min [ v(i, j) + vj(k-1) ]
vi(k) étant la valeur minimale
k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3 du chemin d’au plus k arcs
v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6 entre xi et xn
k=2

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0 vi(k) = min [ v(i, j) + vj(k-1) ]
vi(k) étant la valeur minimale
k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3 du chemin d’au plus k arcs
v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6 entre xi et xn
k=2 v12(2) = v(12, 15) + v15(1) = 9 + 6 = 15
v13(2) = v(13, 14) + v14(1) = 3 + 3 = 6
v14(2) = v(14, 14) + v14(1) = 0 + 3 = 3
v15(2) = min [v(15, 14) + v14(1) , v(15,15) + v15(1) ] = min (8, 6) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0 vi(k) = min [ v(i, j) + vj(k-1) ]
vi(k) étant la valeur minimale
k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3 du chemin d’au plus k arcs
v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6 entre xi et xn
k=2 v12(2) = v(12, 15) + v15(1) = 9 + 6 = 15
v13(2) = v(13, 14) + v14(1) = 3 + 3 = 6
v14(2) = v(14, 14) + v14(1) = 0 + 3 = 3
v15(2) = min [v(15, 14) + v14(1) , v(15,15) + v15(1) ] = min (8, 6) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0 vi(k) = min [ v(i, j) + vj(k-1) ]
vi(k) étant la valeur minimale
k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3 du chemin d’au plus k arcs
v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6 entre xi et xn
k=2 v12(2) = v(12, 15) + v15(1) = 9 + 6 = 15
v13(2) = v(13, 14) + v14(1) = 3 + 3 = 6
v14(2) = v(14, 14) + v14(1) = 0 + 3 = 3
v15(2) = min [v(15, 14) + v14(1) , v(15,15) + v15(1) ] = min (8, 6) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0 vi(k) = min [ v(i, j) + vj(k-1) ]
vi(k) étant la valeur minimale
k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3 du chemin d’au plus k arcs
v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6 entre xi et xn
k=2 v12(2) = v(12, 15) + v15(1) = 9 + 6 = 15
v13(2) = v(13, 14) + v14(1) = 3 + 3 = 6
v14(2) = v(14, 14) + v14(1) = 0 + 3 = 3
v15(2) = min [v(15, 14) + v14(1) , v(15,15) + v15(1) ] = min (8, 6) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0 vi(k) = min [ v(i, j) + vj(k-1) ]
vi(k) étant la valeur minimale
k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3 du chemin d’au plus k arcs
v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6 entre xi et xn
k=2 v12(2) = v(12, 15) + v15(1) = 9 + 6 = 15
v13(2) = v(13, 14) + v14(1) = 3 + 3 = 6
v14(2) = v(14, 14) + v14(1) = 0 + 3 = 3
v15(2) = min [v(15, 14) + v14(1) , v(15,15) + v15(1) ] = min (8, 6) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 12 x13
x11
Initialisation :
V16(1) = v(16,16) = 0 vi(k) = min [ v(i, j) + vj(k-1) ]
vi(k) étant la valeur minimale
k=1 v1(1) = v(1, 16) =  v14(1) = v(14, 16) = 3 du chemin d’au plus k arcs
v2(1) = v(2, 16) =  … v15(1) = v(15, 16) = 6 entre xi et xn
k=2 v12(2) = v(12, 15) + v15(1) = 9 + 6 = 15
v13(2) = v(13, 14) + v14(1) = 3 + 3 = 6
v14(2) = v(14, 14) + v14(1) = 0 + 3 = 3
v15(2) = min [v(15, 14) + v14(1) , v(15,15) + v15(1) ] = min (8, 6) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 12 x13
x11

k=3 v10(3) = v(10, 12) + v12(2) = 7 + 15 = 22

v11(3) = min [v(11, 12) + v12(2) , v(11, 13) + v13(2) ]= min (21, 18) = 18
v12(3) = v12(2) = 15
v14(3) = v14(2) = 3
v13(3) = v13(2) = 6
v15(3) = v15(2) = 6
vi(k) = min [ v(i, j) + vj(k-1) ], vi(k) - valeur minimale du chemin d’au plus k arcs entre xi et xn
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 12 x13
x11

k=3 v10(3) = v(10, 12) + v12(2) = 7 + 15 = 22

v11(3) = min [v(11, 12) + v12(2) , v(11, 13) + v13(2) ]= min (21, 18) = 18
v12(3) = v12(2) = 15
v14(3) = v14(2) = 3
v13(3) = v13(2) = 6
v15(3) = v15(2) = 6
vi(k) = min [ v(i, j) + vj(k-1) ], vi(k) - valeur minimale du chemin d’au plus k arcs entre xi et xn
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 12 x13
x11

k=3 v10(3) = v(10, 12) + v12(2) = 7 + 15 = 22

v11(3) = min [v(11, 12) + v12(2) , v(11, 13) + v13(2) ]= min (21, 18) = 18
v12(3) = v12(2) = 15
v14(3) = v14(2) = 3
v13(3) = v13(2) = 6
v15(3) = v15(2) = 6
vi(k) = min [ v(i, j) + vj(k-1) ], vi(k) - valeur minimale du chemin d’au plus k arcs entre xi et xn
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 12 x13
x11

k=3 v10(3) = v(10, 12) + v12(2) = 7 + 15 = 22

v11(3) = min [v(11, 12) + v12(2) , v(11, 13) + v13(2) ]= min (21, 18) = 18
v12(3) = v12(2) = 15
v14(3) = v14(2) = 3
v13(3) = v13(2) = 6
v15(3) = v15(2) = 6
vi(k) = min [ v(i, j) + vj(k-1) ], vi(k) - valeur minimale du chemin d’au plus k arcs entre xi et xn
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 12 x13
x11

k=3 v10(3) = v(10, 12) + v12(2) = 7 + 15 = 22

v11(3) = min [v(11, 12) + v12(2) , v(11, 13) + v13(2) ]= min (21, 18) = 18
v12(3) = v12(2) = 15
v13(3) = v13(2) = 6
v13(3) = v13(2) = 6
v15(3) = v15(2) = 6
vi(k) = min [ v(i, j) + vj(k-1) ], vi(k) - valeur minimale du chemin d’au plus k arcs entre xi et xn
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 12 x13
x11

k=3 v10(3) = v(10, 12) + v12(2) = 7 + 15 = 22

v11(3) = min [v(11, 12) + v12(2) , v(11, 13) + v13(2) ]= min (21, 18) = 18
v12(3) = v12(2) = 15
v13(3) = v13(2) = 6
v14(3) = v14(2) = 3
v15(3) = v15(2) = 6
vi(k) = min [ v(i, j) + vj(k-1) ], vi(k) - valeur minimale du chemin d’au plus k arcs entre xi et xn
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 12 x13
x11

k=3 v10(3) = v(10, 12) + v12(2) = 7 + 15 = 22

v11(3) = min [v(11, 12) + v12(2) , v(11, 13) + v13(2) ]= min (21, 18) = 18
v12(3) = v12(2) = 15
v13(3) = v13(2) = 6
v14(3) = v14(2) = 3
v15(3) = v15(2) = 6
vi(k) = min [ v(i, j) + vj(k-1) ], vi(k) - valeur minimale du chemin d’au plus k arcs entre xi et xn
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4 22
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 12 x13
x11

k=3 v10(3) = v(10, 12) + v12(2) = 7 + 15 = 22

v11(3) = min [v(11, 12) + v12(2) , v(11, 13) + v13(2) ]= min (21, 18) = 18
v12(3) = v12(2) = 15
v13(3) = v13(2) = 6
v14(3) = v14(2) = 3
v15(3) = v15(2) = 6
vi(k) = min [ v(i, j) + vj(k-1) ], vi(k) - valeur minimale du chemin d’au plus k arcs entre xi et xn
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4 22
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 18
x11 12 x13

k=3 v10(3) = v(10, 12) + v12(2) = 7 + 15 = 22

v11(3) = min [v(11, 12) + v12(2) , v(11, 13) + v13(2) ]= min (21, 18) = 18
v12(3) = v12(2) = 15
v13(3) = v13(2) = 6
v14(3) = v14(2) = 3
v15(3) = v15(2) = 6
vi(k) = min [ v(i, j) + vj(k-1) ], vi(k) - valeur minimale du chemin d’au plus k arcs entre xi et xn
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4 22
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 18
x11 12 x13

k=4

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4 22
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 18
x11 12 x13

k=4 v3(4) = v(3, 11) + v11(3) = 16 + 18 = 34

v7(4) = v(7, 11) + v11(3) = 8 + 18 = 26
v8(4) = v(8, 10) + v10(3) = 2 + 22 = 24
v9(4) = v(9, 10) + v10(3) = 4 + 22 = 26
v10(4) = v10(3) = 22
v11(4) = v11(3) = 18
v12(4) = v12(3) = 15
v13(4) = v13(3) = 6 v14(4) = v14(3) = 3 v15(4) = v15(3) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4 22
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 18
x11 12 x13

k=4 v3(4) = v(3, 11) + v11(3) = 16 + 18 = 34

v7(4) = v(7, 11) + v11(3) = 8 + 18 = 26
v8(4) = v(8, 10) + v10(3) = 2 + 22 = 24
v9(4) = v(9, 10) + v10(3) = 4 + 22 = 26
v10(4) = v10(3) = 22
v11(4) = v11(3) = 18
v12(4) = v12(3) = 15
v13(4) = v13(3) = 6 v14(4) = v14(3) = 3 v15(4) = v15(3) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4 22
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 18
x11 12 x13

k=4 v3(4) = v(3, 11) + v11(3) = 16 + 18 = 34

v7(4) = v(7, 11) + v11(3) = 8 + 18 = 26
v8(4) = v(8, 10) + v10(3) = 2 + 22 = 24
v9(4) = v(9, 10) + v10(3) = 4 + 22 = 26
v10(4) = v10(3) = 22
v11(4) = v11(3) = 18
v12(4) = v12(3) = 15
v13(4) = v13(3) = 6 v14(4) = v14(3) = 3 v15(4) = v15(3) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4 22
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 18
x11 12 x13

k=4 v3(4) = v(3, 11) + v11(3) = 16 + 18 = 34

v7(4) = v(7, 11) + v11(3) = 8 + 18 = 26
v8(4) = v(8, 10) + v10(3) = 2 + 22 = 24
v9(4) = v(9, 10) + v10(3) = 4 + 22 = 26
v10(4) = v10(3) = 22
v11(4) = v11(3) = 18
v12(4) = v12(3) = 15
v13(4) = v13(3) = 6 v14(4) = v14(3) = 3 v15(4) = v15(3) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4 22
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
16 18
x11 12 x13

k=4 v3(4) = v(3, 11) + v11(3) = 16 + 18 = 34

v7(4) = v(7, 11) + v11(3) = 8 + 18 = 26
v8(4) = v(8, 10) + v10(3) = 2 + 22 = 24
v9(4) = v(9, 10) + v10(3) = 4 + 22 = 26
v10(4) = v10(3) = 22
v11(4) = v11(3) = 18
v12(4) = v12(3) = 15
v13(4) = v13(3) = 6 v14(4) = v14(3) = 3 v15(4) = v15(3) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4 22
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=4 v3(4) = v(3, 11) + v11(3) = 16 + 18 = 34

v7(4) = v(7, 11) + v11(3) = 8 + 18 = 26
v8(4) = v(8, 10) + v10(3) = 2 + 22 = 24
v9(4) = v(9, 10) + v10(3) = 4 + 22 = 26
v10(4) = v10(3) = 22
v11(4) = v11(3) = 18
v12(4) = v12(3) = 15
v13(4) = v13(3) = 6 v14(4) = v14(3) = 3 v15(4) = v15(3) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4 22
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 6
26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=4 v3(4) = v(3, 11) + v11(3) = 16 + 18 = 34

v7(4) = v(7, 11) + v11(3) = 8 + 18 = 26
v8(4) = v(8, 10) + v10(3) = 2 + 22 = 24
v9(4) = v(9, 10) + v10(3) = 4 + 22 = 26
v10(4) = v10(3) = 22
v11(4) = v11(3) = 18
v12(4) = v12(3) = 15
v13(4) = v13(3) = 6 v14(4) = v14(3) = 3 v15(4) = v15(3) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

1 4 22
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=4 v3(4) = v(3, 11) + v11(3) = 16 + 18 = 34

v7(4) = v(7, 11) + v11(3) = 8 + 18 = 26
v8(4) = v(8, 10) + v10(3) = 2 + 22 = 24
v9(4) = v(9, 10) + v10(3) = 4 + 22 = 26
v10(4) = v10(3) = 22
v11(4) = v11(3) = 18
v12(4) = v12(3) = 15
v13(4) = v13(3) = 6 v14(4) = v14(3) = 3 v15(4) = v15(3) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

26 22
1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=4 v3(4) = v(3, 11) + v11(3) = 16 + 18 = 34

v7(4) = v(7, 11) + v11(3) = 8 + 18 = 26
v8(4) = v(8, 10) + v10(3) = 2 + 22 = 24
v9(4) = v(9, 10) + v10(3) = 4 + 22 = 26
v10(4) = v10(3) = 22
v11(4) = v11(3) = 18
v12(4) = v12(3) = 15
v13(4) = v13(3) = 6 v14(4) = v14(3) = 3 v15(4) = v15(3) = 6
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

26 22
1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

26 22
1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5 v2(5) = v(2, 3) + v3(4) = 15 + 34 = 49

v4(5) = v(4, 3) + v3(4) = 8 + 34 = 42
v5(5) = v(5, 9) + v9(4) = 1 + 26 = 27
v6(5) = v(6, 7) + v7(4) = 4 + 26 = 30
v7(5) = min [v(7, 8) + v8(4) , v(7, 11) + v11(4) ]= min (25, 26) = 25
v8(5) = min [v(8, 7) + v7(4) , v(8, 10) + v10(4) ]= min (27, 24) = 24
v9(5) = min [v(9, 10) + v10(4) , v(9, 8) + v8(4) ]= min (26, 27) = 26

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

26 22
1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5 v2(5) = v(2, 3) + v3(4) = 15 + 34 = 49

v4(5) = v(4, 3) + v3(4) = 8 + 34 = 42
v5(5) = v(5, 9) + v9(4) = 1 + 26 = 27
v6(5) = v(6, 7) + v7(4) = 4 + 26 = 30
v7(5) = min [v(7, 8) + v8(4) , v(7, 11) + v11(4) ]= min (25, 26) = 25
v8(5) = min [v(8, 7) + v7(4) , v(8, 10) + v10(4) ]= min (27, 24) = 24
v9(5) = min [v(9, 10) + v10(4) , v(9, 8) + v8(4) ]= min (26, 27) = 26

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

26 22
1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5 v2(5) = v(2, 3) + v3(4) = 15 + 34 = 49

v4(5) = v(4, 3) + v3(4) = 8 + 34 = 42
v5(5) = v(5, 9) + v9(4) = 1 + 26 = 27
v6(5) = v(6, 7) + v7(4) = 4 + 26 = 30
v7(5) = min [v(7, 8) + v8(4) , v(7, 11) + v11(4) ]= min (25, 26) = 25
v8(5) = min [v(8, 7) + v7(4) , v(8, 10) + v10(4) ]= min (27, 24) = 24
v9(5) = min [v(9, 10) + v10(4) , v(9, 8) + v8(4) ]= min (26, 27) = 26

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

26 22
1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5 v2(5) = v(2, 3) + v3(4) = 15 + 34 = 49

v4(5) = v(4, 3) + v3(4) = 8 + 34 = 42
v5(5) = v(5, 9) + v9(4) = 1 + 26 = 27
v6(5) = v(6, 7) + v7(4) = 4 + 26 = 30
v7(5) = min [v(7, 8) + v8(4) , v(7, 11) + v11(4) ]= min (25, 26) = 25
v8(5) = min [v(8, 7) + v7(4) , v(8, 10) + v10(4) ]= min (27, 24) = 24
v9(5) = min [v(9, 10) + v10(4) , v(9, 8) + v8(4) ]= min (26, 27) = 26

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

26 22
1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5 v2(5) = v(2, 3) + v3(4) = 15 + 34 = 49

v4(5) = v(4, 3) + v3(4) = 8 + 34 = 42
v5(5) = v(5, 9) + v9(4) = 1 + 26 = 27
v6(5) = v(6, 7) + v7(4) = 4 + 26 = 30
v7(5) = min [v(7, 8) + v8(4) , v(7, 11) + v11(4) ]= min (25, 26) = 25
v8(5) = min [v(8, 7) + v7(4) , v(8, 10) + v10(4) ]= min (27, 24) = 24
v9(5) = min [v(9, 10) + v10(4) , v(9, 8) + v8(4) ]= min (26, 27) = 26

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

26 22
1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5 v2(5) = v(2, 3) + v3(4) = 15 + 34 = 49

v4(5) = v(4, 3) + v3(4) = 8 + 34 = 42
v5(5) = v(5, 9) + v9(4) = 1 + 26 = 27
v6(5) = v(6, 7) + v7(4) = 4 + 26 = 30
v7(5) = min [v(7, 8) + v8(4) , v(7, 11) + v11(4) ]= min (25, 26) = 25
v8(5) = min [v(8, 7) + v7(4) , v(8, 10) + v10(4) ]= min (27, 24) = 24
v9(5) = min [v(9, 10) + v10(4) , v(9, 8) + v8(4) ]= min (26, 27) = 26

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

26 22
1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5 v2(5) = v(2, 3) + v3(4) = 15 + 34 = 49

v4(5) = v(4, 3) + v3(4) = 8 + 34 = 42
v5(5) = v(5, 9) + v9(4) = 1 + 26 = 27
v6(5) = v(6, 7) + v7(4) = 4 + 26 = 30
v7(5) = min [v(7, 8) + v8(4) , v(7, 11) + v11(4) ]= min (25, 26) = 25
v8(5) = min [v(8, 7) + v7(4) , v(8, 10) + v10(4) ]= min (27, 24) = 24
v9(5) = min [v(9, 10) + v10(4) , v(9, 8) + v8(4) ]= min (26, 27) = 26

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

26 22
1 4
6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
49 26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5 v2(5) = v(2, 3) + v3(4) = 15 + 34 = 49

v4(5) = v(4, 3) + v3(4) = 8 + 34 = 42
v5(5) = v(5, 9) + v9(4) = 1 + 26 = 27
v6(5) = v(6, 7) + v7(4) = 4 + 26 = 30
v7(5) = min [v(7, 8) + v8(4) , v(7, 11) + v11(4) ]= min (25, 26) = 25
v8(5) = min [v(8, 7) + v7(4) , v(8, 10) + v10(4) ]= min (27, 24) = 24
v9(5) = min [v(9, 10) + v10(4) , v(9, 8) + v8(4) ]= min (26, 27) = 26

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
49 26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5 v2(5) = v(2, 3) + v3(4) = 15 + 34 = 49

v4(5) = v(4, 3) + v3(4) = 8 + 34 = 42
v5(5) = v(5, 9) + v9(4) = 1 + 26 = 27
v6(5) = v(6, 7) + v7(4) = 4 + 26 = 30
v7(5) = min [v(7, 8) + v8(4) , v(7, 11) + v11(4) ]= min (25, 26) = 25
v8(5) = min [v(8, 7) + v7(4) , v(8, 10) + v10(4) ]= min (27, 24) = 24
v9(5) = min [v(9, 10) + v10(4) , v(9, 8) + v8(4) ]= min (26, 27) = 26

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
1 x8 24 6
49 26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5 v2(5) = v(2, 3) + v3(4) = 15 + 34 = 49

v4(5) = v(4, 3) + v3(4) = 8 + 34 = 42
v5(5) = v(5, 9) + v9(4) = 1 + 26 = 27
v6(5) = v(6, 7) + v7(4) = 4 + 26 = 30
v7(5) = min [v(7, 8) + v8(4) , v(7, 11) + v11(4) ]= min (25, 26) = 25
v8(5) = min [v(8, 7) + v7(4) , v(8, 10) + v10(4) ]= min (27, 24) = 24
v9(5) = min [v(9, 10) + v10(4) , v(9, 8) + v8(4) ]= min (26, 27) = 26

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
49 26 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5 v2(5) = v(2, 3) + v3(4) = 15 + 34 = 49

v4(5) = v(4, 3) + v3(4) = 8 + 34 = 42
v5(5) = v(5, 9) + v9(4) = 1 + 26 = 27
v6(5) = v(6, 7) + v7(4) = 4 + 26 = 30
v7(5) = min [v(7, 8) + v8(4) , v(7, 11) + v11(4) ]= min (25, 26) = 25
v8(5) = min [v(8, 7) + v7(4) , v(8, 10) + v10(4) ]= min (27, 24) = 24
v9(5) = min [v(9, 10) + v10(4) , v(9, 8) + v8(4) ]= min (26, 27) = 26

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
49 25 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=5 v2(5) = v(2, 3) + v3(4) = 15 + 34 = 49

v4(5) = v(4, 3) + v3(4) = 8 + 34 = 42
v5(5) = v(5, 9) + v9(4) = 1 + 26 = 27
v6(5) = v(6, 7) + v7(4) = 4 + 26 = 30
v7(5) = min [v(7, 8) + v8(4) , v(7, 11) + v11(4) ]= min (25, 26) = 25
v8(5) = min [v(8, 7) + v7(4) , v(8, 10) + v10(4) ]= min (27, 24) = 24
v9(5) = min [v(9, 10) + v10(4) , v(9, 8) + v8(4) ]= min (26, 27) = 26

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
49 25 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=6

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
49 25 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=6 v1(6) = v(1, 2) + v2(5) = 10 + 49 = 59

v2(6) = min [v(2, 3) + v3(5) , v(2, 4) + v4(5) ]= min (49, 50) = 49
v3(6) = min [v(3, 6) + v6(5) , v(3, 11) + v11(5) ]= min (31, 34) = 31
v4(6) = min [v(4, 3) + v3(5) , v(4, 5) + v5(5) ]= min (42, 33) = 33
v6(6) = min [v(6, 5) + v5(5) , v(6, 7) + v7(5) ]= min (32, 29) = 29
v7(6) = min [v(7, 8) + v8(5) , v(7, 11) + v11(5) ]= min (25, 26) = 25
v8(6) = min [v(8, 7) + v7(5) , v(8, 10) + v10(5) ]= min (26, 24) = 24
v9(6) = min [v(9, 8) + v8(5) , v(9, 10) + v10(5) ]= min (27, 26) = 26
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
49 25 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=6 v1(6) = v(1, 2) + v2(5) = 10 + 49 = 59

v2(6) = min [v(2, 3) + v3(5) , v(2, 4) + v4(5) ]= min (49, 50) = 49
v3(6) = min [v(3, 6) + v6(5) , v(3, 11) + v11(5) ]= min (31, 34) = 31
v4(6) = min [v(4, 3) + v3(5) , v(4, 5) + v5(5) ]= min (42, 33) = 33
v6(6) = min [v(6, 5) + v5(5) , v(6, 7) + v7(5) ]= min (32, 29) = 29
v7(6) = min [v(7, 8) + v8(5) , v(7, 11) + v11(5) ]= min (25, 26) = 25
v8(6) = min [v(8, 7) + v7(5) , v(8, 10) + v10(5) ]= min (26, 24) = 24
v9(6) = min [v(9, 8) + v8(5) , v(9, 10) + v10(5) ]= min (27, 26) = 26
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
49 25 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=6 v1(6) = v(1, 2) + v2(5) = 10 + 49 = 59

v2(6) = min [v(2, 3) + v3(5) , v(2, 4) + v4(5) ]= min (49, 50) = 49
v3(6) = min [v(3, 6) + v6(5) , v(3, 11) + v11(5) ]= min (31, 34) = 31
v4(6) = min [v(4, 3) + v3(5) , v(4, 5) + v5(5) ]= min (42, 33) = 33
v6(6) = min [v(6, 5) + v5(5) , v(6, 7) + v7(5) ]= min (32, 29) = 29
v7(6) = min [v(7, 8) + v8(5) , v(7, 11) + v11(5) ]= min (25, 26) = 25
v8(6) = min [v(8, 7) + v7(5) , v(8, 10) + v10(5) ]= min (26, 24) = 24
v9(6) = min [v(9, 8) + v8(5) , v(9, 10) + v10(5) ]= min (27, 26) = 26
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
49 25 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=6 v1(6) = v(1, 2) + v2(5) = 10 + 49 = 59

v2(6) = min [v(2, 3) + v3(5) , v(2, 4) + v4(5) ]= min (49, 50) = 49
v3(6) = min [v(3, 6) + v6(5) , v(3, 11) + v11(5) ]= min (31, 34) = 31
v4(6) = min [v(4, 3) + v3(5) , v(4, 5) + v5(5) ]= min (42, 33) = 33
v6(6) = min [v(6, 5) + v5(5) , v(6, 7) + v7(5) ]= min (32, 29) = 29
v7(6) = min [v(7, 8) + v8(5) , v(7, 11) + v11(5) ]= min (25, 26) = 25
v8(6) = min [v(8, 7) + v7(5) , v(8, 10) + v10(5) ]= min (26, 24) = 24
v9(6) = min [v(9, 8) + v8(5) , v(9, 10) + v10(5) ]= min (27, 26) = 26
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
49 25 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=6 v1(6) = v(1, 2) + v2(5) = 10 + 49 = 59

v2(6) = min [v(2, 3) + v3(5) , v(2, 4) + v4(5) ]= min (49, 50) = 49
v3(6) = min [v(3, 6) + v6(5) , v(3, 11) + v11(5) ]= min (31, 34) = 31
v4(6) = min [v(4, 3) + v3(5) , v(4, 5) + v5(5) ]= min (42, 33) = 33
v6(6) = min [v(6, 5) + v5(5) , v(6, 7) + v7(5) ]= min (32, 29) = 29
v7(6) = min [v(7, 8) + v8(5) , v(7, 11) + v11(5) ]= min (25, 26) = 25
v8(6) = min [v(8, 7) + v7(5) , v(8, 10) + v10(5) ]= min (26, 24) = 24
v9(6) = min [v(9, 8) + v8(5) , v(9, 10) + v10(5) ]= min (27, 26) = 26
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
49 25 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=6 v1(6) = v(1, 2) + v2(5) = 10 + 49 = 59

v2(6) = min [v(2, 3) + v3(5) , v(2, 4) + v4(5) ]= min (49, 50) = 49
v3(6) = min [v(3, 6) + v6(5) , v(3, 11) + v11(5) ]= min (31, 34) = 31
v4(6) = min [v(4, 3) + v3(5) , v(4, 5) + v5(5) ]= min (42, 33) = 33
v6(6) = min [v(6, 5) + v5(5) , v(6, 7) + v7(5) ]= min (32, 29) = 29
v7(6) = min [v(7, 8) + v8(5) , v(7, 11) + v11(5) ]= min (25, 26) = 25
v8(6) = min [v(8, 7) + v7(5) , v(8, 10) + v10(5) ]= min (26, 24) = 24
v9(6) = min [v(9, 8) + v8(5) , v(9, 10) + v10(5) ]= min (27, 26) = 26
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
49 25 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=6 v1(6) = v(1, 2) + v2(5) = 10 + 49 = 59

v2(6) = min [v(2, 3) + v3(5) , v(2, 4) + v4(5) ]= min (49, 50) = 49
v3(6) = min [v(3, 6) + v6(5) , v(3, 11) + v11(5) ]= min (31, 34) = 31
v4(6) = min [v(4, 3) + v3(5) , v(4, 5) + v5(5) ]= min (42, 33) = 33
v6(6) = min [v(6, 5) + v5(5) , v(6, 7) + v7(5) ]= min (32, 29) = 29
v7(6) = min [v(7, 8) + v8(5) , v(7, 11) + v11(5) ]= min (25, 26) = 25
v8(6) = min [v(8, 7) + v7(5) , v(8, 10) + v10(5) ]= min (26, 24) = 24
v9(6) = min [v(9, 8) + v8(5) , v(9, 10) + v10(5) ]= min (27, 26) = 26
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
49 25 0
x1 10 x2 8 x6 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=6 v1(6) = v(1, 2) + v2(5) = 10 + 49 = 59

v2(6) = min [v(2, 3) + v3(5) , v(2, 4) + v4(5) ]= min (49, 50) = 49
v3(6) = min [v(3, 6) + v6(5) , v(3, 11) + v11(5) ]= min (31, 34) = 31
v4(6) = min [v(4, 3) + v3(5) , v(4, 5) + v5(5) ]= min (42, 33) = 33
v6(6) = min [v(6, 5) + v5(5) , v(6, 7) + v7(5) ]= min (32, 29) = 29
v7(6) = min [v(7, 8) + v8(5) , v(7, 11) + v11(5) ]= min (25, 26) = 25
v8(6) = min [v(8, 7) + v7(5) , v(8, 10) + v10(5) ]= min (26, 24) = 24
v9(6) = min [v(9, 8) + v8(5) , v(9, 10) + v10(5) ]= min (27, 26) = 26
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
59 49
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
34 16 18
x11 12 x13

k=6 v1(6) = v(1, 2) + v2(5) = 10 + 49 = 59

v2(6) = min [v(2, 3) + v3(5) , v(2, 4) + v4(5) ]= min (49, 50) = 49
v3(6) = min [v(3, 6) + v6(5) , v(3, 11) + v11(5) ]= min (31, 34) = 31
v4(6) = min [v(4, 3) + v3(5) , v(4, 5) + v5(5) ]= min (42, 33) = 33
v6(6) = min [v(6, 5) + v5(5) , v(6, 7) + v7(5) ]= min (32, 29) = 29
v7(6) = min [v(7, 8) + v8(5) , v(7, 11) + v11(5) ]= min (25, 26) = 25
v8(6) = min [v(8, 7) + v7(5) , v(8, 10) + v10(5) ]= min (26, 24) = 24
v9(6) = min [v(9, 8) + v8(5) , v(9, 10) + v10(5) ]= min (27, 26) = 26
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
42 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
59 49
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
31 16 18
x11 12 x13

k=6 v1(6) = v(1, 2) + v2(5) = 10 + 49 = 59

v2(6) = min [v(2, 3) + v3(5) , v(2, 4) + v4(5) ]= min (49, 50) = 49
v3(6) = min [v(3, 6) + v6(5) , v(3, 11) + v11(5) ]= min (31, 34) = 31
v4(6) = min [v(4, 3) + v3(5) , v(4, 5) + v5(5) ]= min (42, 33) = 33
v6(6) = min [v(6, 5) + v5(5) , v(6, 7) + v7(5) ]= min (32, 29) = 29
v7(6) = min [v(7, 8) + v8(5) , v(7, 11) + v11(5) ]= min (25, 26) = 25
v8(6) = min [v(8, 7) + v7(5) , v(8, 10) + v10(5) ]= min (26, 24) = 24
v9(6) = min [v(9, 8) + v8(5) , v(9, 10) + v10(5) ]= min (27, 26) = 26
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
30 1 x8 24 6
59 49
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
31 16 18
x11 12 x13

k=6 v1(6) = v(1, 2) + v2(5) = 10 + 49 = 59

v2(6) = min [v(2, 3) + v3(5) , v(2, 4) + v4(5) ]= min (49, 50) = 49
v3(6) = min [v(3, 6) + v6(5) , v(3, 11) + v11(5) ]= min (31, 34) = 31
v4(6) = min [v(4, 3) + v3(5) , v(4, 5) + v5(5) ]= min (42, 33) = 33
v6(6) = min [v(6, 5) + v5(5) , v(6, 7) + v7(5) ]= min (32, 29) = 29
v7(6) = min [v(7, 8) + v8(5) , v(7, 11) + v11(5) ]= min (25, 26) = 25
v8(6) = min [v(8, 7) + v7(5) , v(8, 10) + v10(5) ]= min (26, 24) = 24
v9(6) = min [v(9, 8) + v8(5) , v(9, 10) + v10(5) ]= min (27, 26) = 26
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
59 49
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
31 16 18
x11 12 x13

k=6 v1(6) = v(1, 2) + v2(5) = 10 + 49 = 59

v2(6) = min [v(2, 3) + v3(5) , v(2, 4) + v4(5) ]= min (49, 50) = 49
v3(6) = min [v(3, 6) + v6(5) , v(3, 11) + v11(5) ]= min (31, 34) = 31
v4(6) = min [v(4, 3) + v3(5) , v(4, 5) + v5(5) ]= min (42, 33) = 33
v6(6) = min [v(6, 5) + v5(5) , v(6, 7) + v7(5) ]= min (32, 29) = 29
v7(6) = min [v(7, 8) + v8(5) , v(7, 11) + v11(5) ]= min (25, 26) = 25
v8(6) = min [v(8, 7) + v7(5) , v(8, 10) + v10(5) ]= min (26, 24) = 24
v9(6) = min [v(9, 8) + v8(5) , v(9, 10) + v10(5) ]= min (27, 26) = 26
version 2.0 2015
 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
59 49
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
31 16 18
x11 12 x13

k=7

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
59 49
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
31 16 18
x11 12 x13

k=7 v1(7) = v(1, 2) + v2(6) = 10 + 49 = 59

v2(7) = min [v(2, 3) + v3(6) , v(2, 4) + v4(6) ]= min (46, 41) = 41
v3(7) = min [v(3, 6) + v6(6) , v(3, 11) + v11(5) ]= min (30, 34) = 30
v4(7) = min [v(4, 3) + v3(6) , v(4, 5) + v5(6) ]= min (39, 33) = 33

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
59 49
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
31 16 18
x11 12 x13

k=7 v1(7) = v(1, 2) + v2(6) = 10 + 49 = 59

v2(7) = min [v(2, 3) + v3(6) , v(2, 4) + v4(6) ]= min (46, 41) = 41
v3(7) = min [v(3, 6) + v6(6) , v(3, 11) + v11(5) ]= min (30, 34) = 30
v4(7) = min [v(4, 3) + v3(6) , v(4, 5) + v5(6) ]= min (39, 33) = 33

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
59 49
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
31 16 18
x11 12 x13

k=7 v1(7) = v(1, 2) + v2(6) = 10 + 49 = 59

v2(7) = min [v(2, 3) + v3(6) , v(2, 4) + v4(6) ]= min (46, 41) = 41
v3(7) = min [v(3, 6) + v6(6) , v(3, 11) + v11(5) ]= min (30, 34) = 30
v4(7) = min [v(4, 3) + v3(6) , v(4, 5) + v5(6) ]= min (39, 33) = 33

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
59 49
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
31 16 18
x11 12 x13

k=7 v1(7) = v(1, 2) + v2(6) = 10 + 49 = 59

v2(7) = min [v(2, 3) + v3(6) , v(2, 4) + v4(6) ]= min (46, 41) = 41
v3(7) = min [v(3, 6) + v6(6) , v(3, 11) + v11(5) ]= min (30, 34) = 30
v4(7) = min [v(4, 3) + v3(6) , v(4, 5) + v5(6) ]= min (39, 33) = 33

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
59 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
31 16 18
x11 12 x13

k=7 v1(7) = v(1, 2) + v2(6) = 10 + 49 = 59

v2(7) = min [v(2, 3) + v3(6) , v(2, 4) + v4(6) ]= min (46, 41) = 41
v3(7) = min [v(3, 6) + v6(6) , v(3, 11) + v11(5) ]= min (30, 34) = 30
v4(7) = min [v(4, 3) + v3(6) , v(4, 5) + v5(6) ]= min (39, 33) = 33

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
59 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
30 16 18
x11 12 x13

k=7 v1(7) = v(1, 2) + v2(6) = 10 + 49 = 59

v2(7) = min [v(2, 3) + v3(6) , v(2, 4) + v4(6) ]= min (46, 41) = 41
v3(7) = min [v(3, 6) + v6(6) , v(3, 11) + v11(5) ]= min (30, 34) = 30
v4(7) = min [v(4, 3) + v3(6) , v(4, 5) + v5(6) ]= min (39, 33) = 33

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
59 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
30 16 18
x11 12 x13

k=8

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
59 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
30 16 18
x11 12 x13

k=8 v1(8) = v(1, 2) + v2(7) = 10 + 41 = 51

v2(8) = min [v(2, 3) + v3(7) , v(2, 4) + v4(7) ]= min (45, 41) = 41

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
51 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
30 16 18
x11 12 x13

k=8 v1(8) = v(1, 2) + v2(7) = 10 + 41 = 51

v2(8) = min [v(2, 3) + v3(7) , v(2, 4) + v4(7) ]= min (45, 41) = 41

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
51 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
30 16 18
x11 12 x13

k=8 v1(8) = v(1, 2) + v2(7) = 10 + 41 = 51

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
51 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
30 16 18
x11 12 x13

k=8 v1(8) = v(1, 2) + v2(7) = 10 + 41 = 51

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
51 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
30 16 18
x11 12 x13

k=8 v1(8) = v(1, 2) + v2(7) = 10 + 41 = 51

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
51 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
30 16 18
x11 12 x13

k=8 v1(8) = v(1, 2) + v2(7) = 10 + 41 = 51

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
51 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
30 16 18
x11 12 x13

k=8 v1(8) = v(1, 2) + v2(7) = 10 + 41 = 51

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
51 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
30 16 18
x11 12 x13

k=8 v1(8) = v(1, 2) + v2(7) = 10 + 41 = 51

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
51 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
30 16 18
x11 12 x13

k=8 v1(8) = v(1, 2) + v2(7) = 10 + 41 = 51

version 2.0 2015

 RECHERCHE Chemin de valeur
OPERATIONNELLE Algorithme de BELLMAN-KALABA optimale

27 26 22
1 4
33 6 x5 x9 7 15
x10
x4 3 2 x12 9 6
8 5 x15
29 1 x8 24 6
51 41
10 x6 25 0
x1 x2 8 4 1 5
x7 6 x16
1 3 3
15 8 6
x3 3 x14
30 16 18
x11 12 x13

k=8 v1(8) = v(1, 2) + v2(7) = 10 + 41 = 51

version 2.0 2015