Consider the min cost max flow problem where we have 6 nodes

Last updated: 10/3/2023

Consider the min cost max flow problem where we have 6 nodes a b c d e f with supply on nodes b e f Sb 3 se 5 sf and demand on nodes c d 4 Sd The network has 9 arcs a c a d b a b c c e d b e a f b f d with associated costs Sc Cac 0 Cad 6 2 1 Cba 8 Cbc 3 Cce 2 Cdb 5 Cea 2 Cfb 0 Cfd 10