title: How can I order the basic solutions of a min cost flow problem according to their cost?
body: <p>I was wondering if, given a min cost flow problem and an integer n, there is an efficient algorithm/package or mathematical method, to obtain the set of the
  n-best basic solutions of the min cost flow problem (instead of just the best).</p>