Minimum cost flow decomposition on arc-coloured networks

Claudio Carvalho Neto, Ana Karolinna Maia, Cláudia Linhares Sales +1

A network $\mathcal{N}$ is formed by a (multi)digraph $D$ together with a \emph{capacity function} $u:A(D)\to R_{+}$, and it is denoted by $\mathcal{N}=(D,u)$. A flow on $\mathc…