codice:
var delta1{K,T} binary ;
var xxl{K,V,V,T} binary;
minimize conve : sum{k in K,t in T} delta1[k,t];
subject to uno { k in K,i in V,t in T} : sum { j in V:j not in N[i]} xxl[k,i,j,t] = 0;
subject to due { k in K,i in V,t in T} : sum {j in V:j in N[i]} xxl[k,i,j,t] <= 1;
subject to tre {k in K ,i in V,t in T:t<=TimeHor-1} : sum {j in N[i]} (xxl[k,j,i,t]) = sum{nn in N[i]} xxl[k,i,nn,t+1];
subject to quattro {k in K}: sum{j in S[k]} (xxl[k,START[k],j,1]) = 1;
subject to cinque {i in V,t in T}: sum{k in K} sum{j in N[i]} (xxl[k,j,i,t]) <= 1;
subject to sei {i in V,j in V,t in T} : sum{k in K} (xxl[k,i,j,t]+xxl[k,j,i,t]) <= 1; subject to sette {k in K,t in T}: sum {i in E[k]} (xxl[k,i,END[k],t]) <= M* (1-delta1[k,t]);
subject to otto {k in K,t in T}: sum {i in E[k]} (xxl[k,i,END[k],t] ) >= 1-delta1[k,t];
subject to nove {k in K,t in T:t<=TimeHor-1}: -delta1[k,t]+delta1[k,t+1] <=0;