Login / Signup

A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives.

László A. Végh
Published in: SIAM J. Comput. (2016)
Keyphrases
  • minimum cost flow
  • convex optimization problems
  • optimization problems
  • convex functions
  • convex optimization
  • network simplex algorithm
  • minimum cost
  • semidefinite programming
  • linear programming
  • strongly polynomial