% data for minimum cost path via DP (instance 2)

C=[ 16    10    11     7;
    10    12    33   -20;
    11    33     0    25;
     7    20    25     9];

D = [16 12 0 9]'; 
i_1 = 3;
N = 30; 
