MinCostFlows.jl

Abstract

MinCostFlows.jl is a utility package in the Julia programming language for efficiently solving min-cost network flow problems through an implementation of the relaxation dual ascent method (Bertsekas, 1985, https://link.springer.com/article/10.1007/BF01586087). The use of a dual ascent method allows for warm-starting the solver with a solution from a previously-solved problem that need not be feasible for the new problem, providing computational performance benefits when repeatedly solving similar network flow problems. This approach is particularly useful for Monte Carlo power system resource adequacy models.