An algorithm, based upon dynamic programming, is developed for a class of fixed-cost cargo loading problems. The problems can be formulated as integer programming problems, but cannot be efficiently solved as such because of computational difficulties. The algorithm developed has proved to be very efficient in an actual operations research study involving over 500 different cargo items, more than 40 possible stops and several types of transportation vehicles. A numerical illustration is provided. (Author)

  • Supplemental Notes:
    • Published in Naval Research Logistics Quarterly v14, n3, p381-90, Sep 1967. Prepared in cooperation with Operations Analysis Corp., Copenhagen, Denmark.
  • Corporate Authors:

    Technical University of Denmark

    Linby Inst of Mathematical Statistics and Operations Res
    Copenhagen,   Denmark 
  • Authors:
    • Pruzan, Peter Mark
    • Jackson, J T
  • Publication Date: 1967-9

Media Info

  • Pagination: 11 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00015147
  • Record Type: Publication
  • Source Agency: Defense Documentation Center
  • Files: TRIS
  • Created Date: May 13 1973 12:00AM