15 citations · 42 across the 16 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011★ 1 cited
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
Laszlo A. Vegh
A well-studied nonlinear extension of the minimum-cost flow problem is to minimize the objective over feasible flows , where on every arc of…
cs.DS2011★ 2 cited
Concave Generalized Flows with Applications to Market Equilibria
Laszlo A. Vegh
We consider a nonlinear extension of the generalized network flow model, with the flow leaving an arc being an increasing concave function of the flow entering it, as proposed by T…