Convex Network Flows

Theo Diamandis, Guillermo Angeris, Alan Edelman

We introduce a general framework for flow problems over hypergraphs. In our problem formulation, which we call the convex flow problem, we have a concave utility function for the n…