The double scaling algorithm is one of the fastest strongly polynomial-time algorithm. It solves the capacitated minimum cost flow problem in O(nmlogUlog(nC)) time. The algorithm is referred to the book Network flows theory algorithms and applications.
-
Notifications
You must be signed in to change notification settings - Fork 0
linshiyx/double-scaling-for-mcf
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published