Polynomial dual network simplex algorithms
暂无分享,去创建一个
[1] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.
[2] Donald Goldfarb,et al. A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n2m) time , 1990, Math. Program..
[3] Éva Tardos,et al. Improved dual network simplex , 1990, SODA '90.
[4] J. Orlin. On the simplex algorithm for networks and generalized networks , 1983 .
[5] Michel Balinski,et al. Signature Methods for the Assignment Problem , 1985, Oper. Res..
[6] Andrew V. Goldberg,et al. Use of dynamic trees in a network simplex algorithm for the maximum flow problem , 1991, Math. Program..
[7] Robert E. Tarjan,et al. Network Flow Algorithms , 1989 .
[8] A. Goldberg,et al. Efficiency of the network simplex algorithm for the maximum flow problem , 1989 .
[9] James B. Orlin,et al. A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.
[10] W. H. Cunningham,et al. Theoretical Properties of the Network Simplex Method , 1979, Math. Oper. Res..
[11] James B. Orlin. A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..
[12] Robert E. Tarjan,et al. Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem , 1991, Math. Oper. Res..
[13] 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 .