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.

  • Supplemental Notes:
    • Published in Transportation Science, November, 1968. V2 N4, pp 383-387.
  • Corporate Authors:

    National Bureau of Standards

    Gaithersburg, MD  United States 
  • Authors:
    • Goldman, A J
  • Publication Date: 1968-11

Media Info

  • Pagination: 5 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00091081
  • Record Type: Publication
  • Source Agency: National Technical Information Service
  • Files: TRIS
  • Created Date: Jun 26 1975 12:00AM