Solving the Convex Cost Integer Dual Network Flow Problem

Abstract

In this paper1, we consider an integer convex optimization problem where the objective function is the sum of separable convex functions (that is, of the form ∑(i,j)ϵQF̄ij(wij) + ∑iϵPB̄i(μi)), the constraints are similar to those arising in the dual of a minimum cost flow problem (that is, of the form μi− μj≤ wij, (i,j)∈Q), with lower and upper bounds on variables. Letn= |P|,m= |Q| , andUbe the largest magnitude in the lower and upper bounds of variables. We call this problemthe convex cost integer dual network flow problem. In this paper, we describe several applications of the convex cost integer dual network flow problem arising in a dial-a-ride transit problem, inverse spanning tree problem, project management, and regression analysis. We develop network flow-based algorithms to solve the convex cost integer dual network flow problem. We show that using the Lagrangian relaxation technique, the convex cost integer dual network flow problem can be transformed into a convex cost primal network flow problem where each cost function is a piecewise linear convex function with integer slopes. Its special structure allows the convex cost primal network flow problem to be solved inO(nmlog(n 2/m)log(nU)time. This time bound is the same time needed to solve the minimum cost flow problem using the cost-scaling algorithm, and is also is best available time bound to solve the convex cost integer dual network flow problem.