How to solve the minimum-cost flow problem on a complete graph, with a concave cost function of flow for each edge?
Here is the problem: Input: A series of source/sink nodes at fixed positions with given outwards/inwards flow Edges are NOT specified. The edges can connect any nodes. The total source and sink flow match A concave cost function that gives a cost per edge in terms of flow capacity Expected output: The minimum costing graph … Read more