Discrete Programming Applications of Techniques for Handling a Common List Structure.

by Bennett L. Fox

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback20 pages $20.00 $16.00 20% Web Discount

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 algorithms. 27 pp. Ref

This report is part of the RAND Corporation research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.