An Efficient Algorithm for Solving Minimum Cost Flow Problem with Complementarity Slack Conditions

Table 1

CPU time on network with varying from 10 to 200 and two different intervals of .

No. of nodes	No. of arcs (average)	AVER. CPU time (s),		AVER. CPU time (s),
		A1	A2	A1	A2
10	32	7.964	0.050	8.002	0.054
10	43	8.245	0.059	8.306	0.064
15	62	8.430	0.060	8.517	0.078
15	99	8.642	0.079	8.726	0.085
20	86	8.578	0.069	8.469	0.086
20	184	8.860	0.102	8.872	0.131
30	210	8.954	0.087	8.936	0.164
30	418	9.014	0.166	9.201	0.258
40	371	8.976	0.092	9.005	0.255
40	763	9.356	0.278	9.428	0.423
50	572	9.169	0.127	9.225	0.397
50	1186	9.628	0.364	9.617	0.673
80	1578	9.725	0.247	9.829	1.056
80	3083	10.427	0.853	10.526	2.502
100	2616	10.320	0.344	10.431	1.734
100	4857	10.569	1.550	10.726	6.438
200	9488	18.351	2.069	19.251	37.181
200	19482	210.358	23.429	221.852	143.759