Skip to content

Fast min-cost flow solver for network optimization in PRAS

License

Notifications You must be signed in to change notification settings

NREL/MinCostFlows.jl

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

35 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

MinCostFlows

Build Status Coverage Status

Efficiently solves the min-cost network flow problem using the Relaxation dual ascent method of Bertsekas (1985).

About

Fast min-cost flow solver for network optimization in PRAS

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages