Network Flow Problems: A Survey

We shall give a brief overview of basic concepts in network flows and the two classical problems of min cost and max flow. Our main focus will be the min-cost network flow with convex cost (as opposed to linear cost) and the description of two algorithms to solve this problem. Finally, we shall examine multicommodity flows, outline some solutions methods for it, and explore the challenges of solving multicommodity flow problem when the flow is required to be integer-valued.

Event Topic

Networks and Optimization