Maximum Flow Problem Instances

Files elist<n>d.rmf were generated by G. Skorobohatyj (ZIB) using the program RMFGEN and contain instances of grids-on-pipe graphs with <n> nodes, see D. Goldfarb and M.D. Grigoriadis, A computational comparison of the Dinic and Network Simplex methods for maximum flow, Annals of Operations Research 13 (1988), 83-123.

RMFGEN - C source code
Info - Description of data format

elist1440.rmf  -  number of edges: 5397
elist1440d.rmf  -  number of edges: 22128
elist160.rmf  -  number of edges: 285
elist160d.rmf  -  number of edges: 912
elist200.rmf  -  number of edges: 483
elist200d.rmf -  number of edges: 1340
elist2560.rmf  -  number of edges: 44160
elist500.rmf  -  number of edges: 1040
elist500d.rmf  -  number of edges: 3975
elist640.rmf  -  number of edges: 3037
elist640d.rmf  -  number of edges: 12608
elist96.rmf  -  number of edges: 187
elist96d.rmf  -  number of edges: 528
elist960.rmf  -  number of edges: 2061
elist960d.rmf  -  number of edges: 9488