https://github.com/shibam120302/mincostflow

https://github.com/shibam120302/mincostflow

Last synced: 3 months ago
JSON representation

• Host: GitHub
• URL: https://github.com/shibam120302/mincostflow
• Owner: shibam120302
• License: apache-2.0
• Created: 2023-04-11T20:35:56.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2023-04-11T20:40:23.000Z (over 2 years ago)
• Last Synced: 2025-01-21T17:50:40.105Z (9 months ago)
• Language: C++
• Size: 98.6 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
Min Cost Flow library

=====================

This is a proof of concept library for solving the Min Cost Flow (MCF) problem

for linear and convex costs functions.

The code and API are highly specialized for the problem domain that involves the

*Uncertainty Networks*, a concept invented by Rene Pickhardt

and implemented in

[pickhardtpayments](github.com/renepickhardt/pickhardtpayments).

The algorithms used here are taken from Ahuja, et. al book "Network Flows:

Theory, Algorithms and Applications", 1993.

Here are some benchmark test I run on my solvers, compared against Google's OR-Tools library.

These results are produced with random graph generated using `networkx` (see `benchmark/gen.py`

for details) using a variable number *N* of nodes and a *M = 7.5 N*.

40 different graphs are generated for each value of *N*.

Costs and capacities for arcs are selected as random numbers from 0 to 200.

![](/assets/benchmark.png)

The C++ API will be out soon!

The C API is described [here](c-api.md).

The Python API is described [here](python-api.md).

Author: Shibam Nath

This work is funded by the [Summer of Bitcoin](www.summerofbitcoin.org) project 2023 edition.