Login / Signup

An Empirical Study of Min Cost Flow Algorithms for the Minimum-Cost Flow Problem.

Robert G. BlandJoseph CheriyanDavid L. JensenLaszlo Ladányi
Published in: Network Flows And Matching (1991)
Keyphrases
  • min cost
  • max flow
  • network flow
  • combinatorial optimization problems
  • parallel processors
  • orders of magnitude
  • worst case
  • optimization problems
  • combinatorial optimization
  • benchmark problems