In this talk we consider how to solve the minimum maximal flow (mmf) problem[1], which minimizes a flow value among the maximal flows in a given directed network. We prove that the target problem can be cast into a bilinear minimization problem over a convex set.
展开▼
