[1] R.K. Ahuja, T.L. Magnanti, and J.B Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, N.J.

[2] J.B. Orlin. A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows. Working Paper WP #3834-95, Alfred P. Sloan School of Management, M.I.T., July 1995.

[3] Y. LEE. Computational analysis of network optimization algorithms. Ph.D. thesis, M.I.T., 1993.

[4] A.V. Goldberg. An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm. In Proc. 3rd int. Prog. and Comb. Opt. Conf., page 251-266, 1993

[5] D. Klingman, A. Napier, and J. Stutz. Netgen: A Program for Generating Large Scale Capacitated Assignment, Transportations, and Minimum Cost Flow Network Problems. Management Science, 20:814-821, 1974.

[6] T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms, page 214, The MIT Press, Cambridge, MA.

[7] E Horowitz, S. Sahni. Fundamentals of Computer Algorithms, page 53-70. Computer Science Press, 1978.

[8] A.V. Goldberg, Personal Communication, 1995.

[9] J.L. Kennington and R.V. Helgason. Algorithms for Network Programming. John Wiley and Sons, 1980

[10] M.D. Grigoriadis. An Efficient Implementation of the Network Simplex Method. Math. Prog. Study, 26:83-111, 1986

[11] D.P. Bertsekas. Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems. Technical Report LIDS-P-1986, Lab. for Decision Systems, M.I.T., September 1986.

[12] D.P. Bertsekas and P. Tseng. Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems. Oper. Res., 36:93-114, 1988.

[13] N.K. Karmarkar and K.G. Ramakrishnan. Computational Results of an Interior Point Algorithm for Large Scale Linear Programming. Math. Prog., 52:555-586, 1991.

[14] W.H. Cunningham. A network simplex method. Math. Prog., 11:105-116, 1976.

[15] R.G. Bland, J. Cheriyan, D.J. Jensen, and L. Ladanyi, An empirical study of recent flow algorithm, The First DIMACS International Algorithm Implementation Challenge: Network Flows and Matching. DIMACS, NJ., 1991.

[16] R.G. Bland and D.L. Jensen, On the computational behavior of a polynomialtime network flow algorithm, Technical Report 661, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1985.

[17] D. Goldfarb and M.D. Grigoriadis, A computational comparison of the Dinic and network simplex methods for maximum flow, In B. Simeone et al. (eds.), FORTRAN Codes for Network Optimization, As Annals of Operations Research, 13:83-124, 1986

[18] U. Derigs and W. Meier, Implementing Goldberg's max-flow algorithm-a computational investigation, ZOR-Methods and Models of Operations Research, 33:383-403, 1989

[19] DIMACS, The First DIMACS International Algorithm Implementation Challenge: Network Flows and Matching. Call for Participation, General Information, and The Core Experiments. DIMACS, NJ., 1990

[20] S. Fujishige, K. Iwano, J. Nakano, and S. Tezuka, A speculative contraction method for the minimum cost flows: toward a practical algorithm. The First DIMACS International Implementation Challenge, Oct., 1991.

[21] A.V. Goldberg, M.D. Grigodiadis, and R.E. Tarjan. Efficiency of the network simplex algorithm for the maximum flow problem, Technical Report, Department of Computer Science, Stanford University, Stanford, CA, 1988.

[22] A.V. Goldberg and M. Kharitonov, Experimental evaluation of the push-relabel method for the minimum-cost flow problem, The First DIMACS International Algorithm Implementation Challenge: Network Flows and Matching. DIMACS, NJ., 1991.

[23] A.V. Goldberg and M. Kharitonov, On implementing scaling push-relabel algorithms for the minimum-cost flow problem, Technical Report STAN-CS-921418, Stanford University, 1992.

[24] A.V. Goldberg and R.E. Tarjan, Solving minimum-cost flow problems by sucessive approximation, Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, (1987), 7-18. Full paper in Mathematics of Operations Research, 15:430-466, 1990.

[25] A.V. Goldberg, Scaling Algorithms for the Shortest Paths Problem. Technical Report STAN-CS-92-1429, Department of Computer Science, Stanford University, 1992.

[26] J. Cheriyan, Personal Communication, 1995.

[27] Y. Lee, Personal Communication, 1995.

Go to Premultiplier C Codes