In this paper¹, we consider an integer convex optimization problem where the objective function is the sum of separable convex functions (that is, of the form \sum _{(i,j)\epsilonQ}F\bar _ij(w_ij) + \sum _i\epsilonPB\bar _i(\mu _i)), the constraints are similar to those arising in the dual of a minimum...

The minimum cost flow problem is to determine a least cost shipment of a commodity through a network G = (N, A) in order to satisfy demands at certain nodes from available supplies at other nodes. In this paper, we study a variant of the minimum cost flow problem where we are given a set R...