论文信息 - Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems - 字舞流文

Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems

Ravindra K. Ahuja | James B. Orlin

[1] Robert E. Tarjan,et al. Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..

[2] M. Engquist. A Successive Shortest Path Algorithm for The Assignment Problem , 1982 .

[3] J. Orlin. Working Paper Alfred P. Sloan School of Management Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem Genuinely Polynominal Simplex and Non-simplex Algorithms for the Minimum Cost Flow Problem , 2008 .

[4] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[5] Norman Zadeh. Near-Equivalence of Network Flow Algorithms. , 1979 .

[6] J. Orlin. On the simplex algorithm for networks and generalized networks , 1983 .

[7] Darwin Klingman,et al. Threshold assignment algorithm , 1986 .

[8] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[9] Donald Goldfarb,et al. Efficient dual simplex algorithms for the assignment problem , 1986, Math. Program..

[10] Darwin Klingman,et al. Enhancements of Spanning Tree Labeling Procedures for Network Optimization. , 1979 .

[11] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[12] Donald B. Johnson,et al. A priority queue in which initialization and queue operations takeO(loglogD) time , 1981, Mathematical systems theory.