MCCFBN-BlockIP is a specialized interior-point algorithm for the solution of minimum cost convex flow problems in bipartite networks, based on the BlockIP solver. MCCFBN-BlockIP is an original idea of Jordi Castro and Stefano Nasini. The algorithm is mainly appropriate for huge unbalanced network problems (e.g., hundreds of millions of arcs, with significantly more nodes in one partition of the nodes than the other).

To obtain the code just download this file , "tar xzvf" it, and follow the instructions in the README file of the directory that will be created.

To cite the algorithm and for details about it:

J. Castro, S. Nasini, A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks, European Journal of Operational Research, 290 (2021), 857-869.