Accession Number : AD0713617

Title :   HOW TO STORE IT,

Corporate Author : RAND CORP SANTA MONICA CALIF

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

Report Date : OCT 1970

Pagination or Media Count : 7

Abstract : Storage layout for branch-and-bound algorithms is discussed. A composite branching rule, alternating between backtracking and branching from the point corresponding to the minimum bound, is recommended as the best compromise between reducing storage and the number of iterations. (Author)

Descriptors :   (*COMPUTER PROGRAMMING, OPERATIONS RESEARCH), DATA STORAGE SYSTEMS, MANAGEMENT PLANNING AND CONTROL, OPTIMIZATION, ITERATIONS, ALGORITHMS

Subject Categories : Operations Research
      Computer Programming and Software
      Computer Hardware

Distribution Statement : APPROVED FOR PUBLIC RELEASE