Specialized algorithms are required to solve transportation and assignment problems optimally and efficiently. Specialized primal simplex and primal-dual transportation codes are compared via a series of bench marks on both small and large problems.
Richard S. Hatch, (1975) Technical Note—Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms. Operations Research 23(6):1167-1172.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.