The minimum cut and maximum flow problems form a well-known pair of dual problems providing a min-max relation. Similarly, the continuous relaxation of the minimum multicut problem is the linear dual ...

This paper presents a descent algorithm for the continuous convex piecewise linear network flow problem (CCPWLNFP). The CCPWLNFP can be reformulated as a linear programming problem and directly solved ...