Introduction
This is where you will get started solving models like
mins.t. k∈K∑e∈Ek∑cexe+i∈N∑fiyik∈K∑e∈Ek∑αjexe+i∈N∑βjiyi=bjxe=p∈Pk∑(s∈p:s=e∑1)λpLk≤p∈Pk∑λp≤Ukλp∈Z+xe∈Zyi∈Zj∈Mk∈K,e∈Ekk∈Kk∈K,p∈Pkk∈K,e∈Eki∈N
given graphs G(Vk,Ek),k∈K with paths p∈Pk subject to resource constraints Rk.