I am wondering if anybody can provide any handy resources (for a theoretical computer scientist) in relation to the convex cost flow problem? I have found texts (mostly my combinatorial optimization texts on my shelf), but they sparingly discuss the problem and its algorithmic properties, and the ones I've found so far take a very deep dive into it without explaining a whole lot or providing any examples. I get the formulation of the problem, but a bit more would be helpful.
I'm new to the problem, and wondering if anybody can suggest some good texts, or papers that do a good job of covering the problem, and some of the major algorithmic results for this problem (computational complexity, and algorithms primarily), or maybe applications of it being used to see how researchers have applied it to solve other problems in theoretical computer science, combinatorial optimization, or operations research.
If you have resources or suggestions, that would be helpful! Thank you so much, and have a beautiful day :).