Abstract
This note demonstrates a simple solution method for the following single-commodity flow problem: Given a set of origins each with a known supply, and a set of destinations each with a known demand, find the minimum possible capacity for a vehicle which is to perform all the origin-to-destination transfers one at a time.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
