Probabilistic Assignment: An Algorithm

Published Online:https://doi.org/10.1287/trsc.8.4.311

This note describes improvements to the assignment algorithm Dial presented to implement his multipath assignment method. It illustrates the advantages of Robillard's refinement over the original Dial approach in terms of savings in computation time as well as in core storage. Moreover, the note provides some figures on the necessary amount of computation time on a particular computer.

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.