… The fact that classical network flow models cannot incorporate these well-studied … In this
paper, we introduce the convex flow problem, a generalization of the network flow problem that …

This paper presents and solves in polynomial time the minimum convex cost dynamic network
flow problem, an infinite horizon integer programming problem which involves network …

… the network flow literature (Ahuja et al., 1993; Bertsekas, 1998), we define a flow as a non-negative
function on arcs that satisfies capacity constraints on all arcs (the value of the flow on …

… Finally, we consider the convex network flow problem with fixed fees for the use of an edge.
In … of the convex network flow problem (1), which we call the network flow problem with fees: …

… network flow problem with both linear and strictly convex possibly nondifferentiable arc costs.
For the case where all arc costs are strictly convex we … minimum cost network flow problem …

… We develop network flow-based algorithms to solve the convex cost integer dual network
flow … problem can be transformed into a convex cost primal network flow problem where each …

… We consider the solution of the single commodity strictly convex network flow problem in a
distributed asynchronous computation environment. The dual ofthis problem is unconstrained, …

… However, unlike the classic network flows literature, we also … In this work, we focus on solving
this more general convex flow … Although this problem is a convex optimization problem, for …

… We also prove that the relaxation remains exact for weakly-cyclic networks with cycles of …
a convex injection region in the lossless case and a non-convex injection region with a convex …

… a multicommodity network flow problem with flow routing and … involving convex, increasing
power functions of flows on the … as a convex function of the capacity level and the flow. Then, …