Improved dual network simplex
暂无分享,去创建一个
[1] W. H. Cunningham,et al. Theoretical Properties of the Network Simplex Method , 1979, Math. Oper. Res..
[2] J. Orlin. On the simplex algorithm for networks and generalized networks , 1983 .
[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] James B. Orlin,et al. A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.
[5] Robert E. Tarjan,et al. Network Flow Algorithms , 1989 .
[6] A. Goldberg,et al. Efficiency of the network simplex algorithm for the maximum flow problem , 1989 .
[7] 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..
[8] Robert E. Tarjan,et al. Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem , 1991, Math. Oper. Res..