MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE
暂无分享,去创建一个
Abstract : It is shown that the problem of determining the minimum number of carriers required to meet a fixed schedule of transportation can be made into a linear programming problem.
[1] J. E. Walsh,et al. Routing of empties for fixed-schedule transportation. , 1950 .