Tillman, Frank A.; Cain, Thomas M. - In: Management Science 18 (1972) 11, pp. 664-682
An upperbound algorithm is presented for solving the multiterminal delivery problem. The method involves determining savings from joining points on routes and making possible assignments as a function of the maximum savings for joining cities on routes. The algorithm permits restrictions to be...