CF 106111A - Non-Cooperative Multi-Commodity Network Flows

We are given a network modeled as a weighted directed graph. Each edge has a cost representing how expensive it is to send a unit of flow along that connection. Alongside the graph, there is a collection of independent “commodities”.