Accession Number : AD0668119

Title :   APPLICATIONS OF BALANCED TREE SEARCH,

Corporate Author : RAND CORP SANTA MONICA CALIF

Personal Author(s) : Fox,Bennett

Report Date : APR 1968

Pagination or Media Count : 19

Abstract : It is shown how balanced tree searching can accelerate incremental allocation and branch and bound algorithms by an order of magnitude. (Author)

Descriptors :   (*OPERATIONS RESEARCH, PROBLEM SOLVING), (*COMPUTER PROGRAMMING, INVENTORY CONTROL), ALGORITHMS, EFFICIENCY, OPTIMIZATION, DATA STORAGE SYSTEMS, MANAGEMENT PLANNING AND CONTROL

Subject Categories : Operations Research
      Computer Programming and Software
      Computer Hardware

Distribution Statement : APPROVED FOR PUBLIC RELEASE