Accession Number : AD0688211

Title :   DISCRETE PROGRAMMING APPLICATIONS OF TECHNIQUES FOR HANDLING A COMMON LIST STRUCTURE,

Corporate Author : RAND CORP SANTA MONICA CALIF

Personal Author(s) : Fox,B. L.

Report Date : MAY 1969

Pagination or Media Count : 27

Abstract : It is pointed out how two list-handling algorithms: heapsort and balanced tree search, can accelerate incremental allocation and branch and bound algorithms--in particular certain integer programming algorithms. The use of incremental allocation and branch and bound algorithms has been important in solving diverse operations research problems arising in inventory control, redundancy optimization, target allocation, and circuit minimization. Any scheme that can make these algorithms more efficient will be of great practical significance. For the incremental allocation application, when no buffering is needed, heapsort seems preferable to handle the storage problem, and it appears that balanced tree search will be better suited for branch and bound and algorithms. (Author)

Descriptors :   (*COMPUTER PROGRAMMING, OPERATIONS RESEARCH), INVENTORY CONTROL, ALGORITHMS, LINEAR PROGRAMMING, OPTIMIZATION

Subject Categories : Operations Research
      Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE