A polynomial time primal network simplex algorithm for minimum cost flows
暂无分享,去创建一个
[1] Norman Zadeh,et al. A bad network problem for the simplex method and other minimum cost flow algorithms , 1973, Math. Program..
[2] William H. Cunningham,et al. A network simplex method , 1976, Math. Program..
[3] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.
[4] E. Roohy-Laleh. Improvements in the Theoretical Efficiency of the Network Simplex Method , 1980 .
[5] R. V. Helgason,et al. Algorithms for network programming , 1980 .
[6] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[7] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[8] J. Orlin. On the simplex algorithm for networks and generalized networks , 1983 .
[9] Ming S. Hung,et al. Technical Note - A Polynomial Simplex Method for the Assignment Problem , 1983, Oper. Res..
[10] Éva Tardos,et al. A strongly polynomial minimum cost circulation algorithm , 1985, Comb..
[11] 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 .
[12] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[13] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..
[14] Andrew V. Goldberg,et al. Solving minimum-cost flow problems by successive approximation , 1987, STOC.
[15] James B. Orlin,et al. A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.
[16] George L. Nemhauser,et al. Handbooks in operations research and management science , 1989 .
[17] Andrew V. Goldberg,et al. Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..
[18] 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..
[19] Donald Goldfarb,et al. Efficient Shortest Path Simplex Algorithms , 1990, Oper. Res..
[20] Éva Tardos,et al. Improved dual network simplex , 1990, SODA '90.
[21] Andrew V. Goldberg,et al. Use of dynamic trees in a network simplex algorithm for the maximum flow problem , 1991, Math. Program..
[22] Donald Goldfarb,et al. On strongly polynomial variants of the network simplex algorithm for the maximum flow problem , 1991, Oper. Res. Lett..
[23] Robert E. Tarjan,et al. Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem , 1991, Math. Oper. Res..
[24] Ravindra K. Ahuja,et al. The Scaling Network Simplex Algorithm , 1992, Oper. Res..
[25] Martin E. Dyer,et al. Random walks, totally unimodular matrices, and a randomised dual simplex algorithm , 1994, IPCO.
[26] Andrew V. Goldberg,et al. Finding minimum-cost flows by double scaling , 2015, Math. Program..
[27] James B. Orlin. A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..
[28] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[29] Éva Tardos,et al. Polynomial dual network simplex algorithms , 2011, Math. Program..
[30] Yusin Lee,et al. Computational analysis of network optimization algorithms , 1993 .
[31] Mustafa Akgül,et al. A Genuinely Polynomial Primal Simplex Algorithm for the Assignment Problem , 1993, Discret. Appl. Math..
[32] Ronald D. Armstrong,et al. A new strongly polynomial dual network simplex algorithm , 1997, Math. Program..
[33] Robert E. Tarjan,et al. Dynamic trees as search trees via euler tours, applied to the network simplex algorithm , 1997, Math. Program..