Login / Signup

Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs.

Maurício C. de SouzaPhilippe MaheyBernard Gendron
Published in: Networks (2008)
Keyphrases
  • network flow problem
  • learning algorithm
  • network design problem
  • computational complexity
  • network flow
  • worst case
  • computationally expensive