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

Bennett L. Fox

ResearchPublished 1969

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

Document Details

Citation

Chicago Manual of Style

Fox, Bennett L., Discrete Programming Applications of Techniques for Handling a Common List Structure. Santa Monica, CA: RAND Corporation, 1969. https://www.rand.org/pubs/research_memoranda/RM5951.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND 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.