Dan Stratila

Learn More
We study the problem of minimizing a nonnegative separable concave function over a compact feasible set. We approximate this problem to within a factor of 1 + by a piecewise-linear minimization problem over the same feasible set. Our main result is that when the feasible set is a polyhedron, the number of resulting pieces is polynomial in the input size of(More)
In this paper we study the dynamic version of the nonlinear minimum-cost flow problem on networks. We consider the problem on dynamic networks with nonlinear cost functions on edges that depend on time and flow. Moreover, we assume that the demand function and capacities of edges also depend on time. To solve the problem we propose an algorithm, which is(More)
  • 1