A new hybrid algorithm for the balanced transportation problem
暂无分享,去创建一个
Sayyed Rasoul Mousavi | S. R. Mousavi | Mohammad S. Sabbagh | Hosein Ghafari | M. Sabbagh | Hosein Ghafari
[1] Péter Kovács,et al. Minimum-cost flow algorithms: an experimental evaluation , 2015, Optim. Methods Softw..
[2] K. D. Sharma,et al. A new dual based procedure for the transportation problem , 2000, Eur. J. Oper. Res..
[3] T. Koopmans. Optimum Utilization of the Transportation System , 1949 .
[4] Sayyed Rasoul Mousavi,et al. A negative dual rectangle cancellation algorithm for the linear assignment problem , 2013, Comput. Ind. Eng..
[5] Angelo Sifaleras,et al. MINIMUM COST NETWORK FLOWS: PROBLEMS, ALGORITHMS, AND SOFTWARE , 2013 .
[6] Frederick S. Hillier,et al. Introduction of Operations Research , 1967 .
[7] D. Bertsekas. The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .
[8] Fred W. Glover,et al. Network models in optimization and their applications in practice , 1992 .
[9] H. Arsham,et al. A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone , 1989 .
[10] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .
[11] Ulrich Brenner,et al. A faster polynomial algorithm for the unbalanced Hitchcock transportation problem , 2008, Oper. Res. Lett..
[12] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[13] D. R. Fulkerson,et al. A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.
[14] F. L. Hitchcock. The Distribution of a Product from Several Sources to Numerous Localities , 1941 .
[15] Jorge A. Ruiz-Vanoye,et al. A Survey of Transportation Problems , 2014, J. Appl. Math..
[16] R. R. K. Sharma,et al. Obtaining a good primal solution to the uncapacitated transportation problem , 2003, Eur. J. Oper. Res..
[17] Charalampos Papamanthou,et al. Computational experience with exterior point algorithms for the transportation problem , 2004, Appl. Math. Comput..
[18] Zoltán Király,et al. Efficient implementations of minimum-cost flow algorithms , 2012, ArXiv.
[19] James B. Orlin. A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..
[20] Leonidas J. Guibas,et al. The Earth Mover's Distance as a Metric for Image Retrieval , 2000, International Journal of Computer Vision.
[21] D. Bertsekas,et al. The auction algorithm for the transportation problem , 1989 .
[22] Jens Vygen,et al. The Book Review Column1 , 2020, SIGACT News.