A new storage reduction technique for the solution of the group problem

Richard V. Helgason and Jeff L. Kennington

Naval Research Logistics Quarterly, 1979, vol. 26, issue 4, 681-687

Abstract: This paper shows that by making use of an unusual property of the decision table associated with the dynamic programming solution to the goup problem, it is possible to dispense with table storage as such, and instead overlay values for both the objective and history functions. Furthermore, this storage reduction is accomplished with no loss in computational efficiency. An algorithm is presented which makes use of this technique and incorporates various additional efficiencies. The reduction in storage achieved for problems from the literature is shown.

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800260413

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:26:y:1979:i:4:p:681-687

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().